In this paper, four algorithms based on some single-pass heuristics are proposed to solve the flexible flow-shop group scheduling problems with more than two machine centers, which have the same number of parallel machines. Single-pass heuristics need less computation time than multiple-pass ones. The single-pass heuristics adopted in the paper includes the PT, the Palmer and the Gupta algorith...

A simulation-based real-time scheduling mechanism for dynamic discrete manufacturing is presented in this paper. Modified mean flow time performance for different scheduling approaches is compared through off-line simulation experiments, under dynamic manufacturing environments that are subjects to disturbances such as machine breakdowns. These experimental results are used as reference indices...

Rapid prototyping of integrated taxiway and runway schedulers at airports has become highly desirable for Safe and Efficient Surface Operations (SESO) to support the Next Generation Air Transportation System (NextGen). Finding optimal solutions for taxiway and runway scheduling are generally computationally difficult and therefore it is essential to develop fast algorithms that can produce high...

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

scheduling of production in flexible manufacturing systems (fmss) has been extensively investigated over the past years and it continues to attract the interest of both academic researchers and practitioners. the generation of new and modified production schedules is becoming a necessity in today’s complex manufacturing environment. genetic algorithms are used in this paper to obtain an initial...

The permutation flow shop scheduling problem (PFSP) is one of the most well known and well studied production scheduling problems with strong industrial background. Most scheduling problems are combinatorial optimization problems which are too difficult to be solved optimally, and hence heuristics are used to obtain good solutions in a reasonable time. The specific goal of this paper is to inve...

aggregate production planning (app) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. in this paper, we develop a mixed integer linear programming (milp) model for an integrated aggregate production planning system with closed loop su...

Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered: immediate mode and batch mode heuristics. Three new heuristics, one for batch mode and two for immediate mode, are introduced as part of this research. Simulation studies are performed to compare thes...