We consider a three-stage dynamic flexible flow shop scheduling problem in which jobs of multiple types arrive dynamically over time, a quality feedback mechanism is present, and the setup timing and the process defect rate are closely related. At each machine in the second stage, a sequence-independent setup operation is necessary to changeover job types. Once a setup is done for a job type at...

This paper presents a Team-Work based architecture for Distributed Manufacturing Scheduling with Genetic Algorithms and Tabu Search. We consider that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and cooperating with other machine agents. Social aspects are considered when a community of autonomous agents cooperate ...

This paper deals with the heuristic solution of flexible flowshop scheduling problems with unrelated parallel machines. A setup time is necessary before starting the processing of a job, where the setup time depends on the previous job. No preemption of jobs is allowed. As objective function, this paper considers the minimization of the positively weighted convex sum of makespan and the number ...

The prediction of river, s discharge rate is one of the important issues in water resources engineering. This issue is very important for the planning, management, and policy making in water resources management, especially in the country like Iran, with limited water resources in line the economic and environmental development. Awareness of how the relationship between rainfall and run...

This paper concerns the domain of flexible manufacturing systems (FMS) and focuses on the scheduling problems encountered in these systems. We have chosen the cyclic behaviour to study this problem, to reduce its complexity. This cyclic scheduling problem, whose complexity is NP-hard in the general case, aims to minimise the work in process (WIP) to satisfy economic constraints. We first recall...

In the current paper, we study the concept of dynamic scheduling in flexible flow Shop with limited carrier under stochastic machine breakdowns and processing time. In most flexible flow shop scheduling methods reported in the literature consider a determinist environment, where all data of the problem are known in advance. Most of these works focused on the development of methods to produce a ...

This paper presents a new modeling of elevator group intelligent scheduling system with destination floor guidance. The traditional input mode of separate hall call registration and the destination selection is improved to a single-input mode. On this basis, dynamic partition method in up-peak traffic is studied. This method means dynamically adjust division of floor region based on flow rate a...

 This paper reports on a simple application of autonomous agents that cooperatively work in a multi-agent system trying to efficiently handle control in flexible manufacturing scenarios. The focus of the paper is on the simulation of scheduling and dispatching algorithms for automated guided vehicles (AGV) in flexible manufacturing systems (FMS). The paper presents a basic design management sy...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...