Effective precedence constrained scheduling in a make-to-order environment

The make-to-order assembly lines have gradually replaced the traditional mass production assembly lines. These assembly lines follow a 'make-to-order' production policy, which are featured with a short production lead time, small number of working stations and highly skilled workers. In order to maximise the throughput under the resource (machine, labour and time) constraints, the problem of minimising makespan with general precedence constraints is addressed in this paper. A mathematical model of the problem is presented and a new heuristic, genetic job-oriented list scheduling (GJLS) is developed. Computational experiments indicate that the proposed algorithm outperforms the existing Graham's list scheduling (GLS).

[1]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[2]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.

[3]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[4]  Ron Y. Pinter,et al.  Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version) , 1985, POPL '85.

[5]  Claudia Ruth Gatica de Videla,et al.  Evolutionary approaches with multirecombination for the parallel machine scheduling problem , 2000, Proceedings 20th International Conference of the Chilean Computer Science Society.

[6]  Klaus Neumann,et al.  Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production , 1997 .

[7]  Stephen F. Smith,et al.  Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling) , 1999, GECCO.

[8]  T. Sawik.  Integer programming approach to production scheduling for make-to-order manufacturing , 2005, Math. Comput. Model..

[9]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[10]  Wu Cheng,et al.  A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines , 1999, Artif. Intell. Eng..

[11]  Ronald L. Graham,et al.  Optimal scheduling for two-processor systems , 1972, Acta Informatica.

[12]  Tadeusz Sawik,et al.  Optimal versus heuristic scheduling of surface mount technology lines , 2004 .

[13]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[14]  C. N. Potts,et al.  Analysis of a linear programming heuristic for scheduling unrelated parallel machines , 1985, Discret. Appl. Math..

[15]  T. C. Hu.  Parallel Sequencing and Assembly Line Problems , 1961 .

[16]  Rakesh Nagi,et al.  'Just-in-time' production of large assemblies , 1996 .

[17]  Keith G. Lockyer,et al.  A practical approach to production scheduling , 1979 .

[18]  Michael David Oliff,et al.  An Integrated Production Planning Model for Multiproduct Parallel Processor Environments , 1982 .

[19]  A. Gunasekaran,et al.  Build‐to‐order supply chain management: a literature review and framework for development , 2005 .

[20]  Yadati Narahari,et al.  Real-world extensions to scheduling algorithms based on lagrangian relaxation , 1996 .

[21]  E. Max,et al.  Parallel machine scheduling using Lagrangian relaxation , 1988, [Proceedings] 1988 International Conference on Computer Integrated Manufacturing.

[22]  Robert E. Markland,et al.  Multi-stage lot sizing in a serial production system , 1986 .

[23]  Martin Grajcar.  Genetic list scheduling algorithm for scheduling and allocation on a loosely coupled heterogeneous multiprocessor system , 1999, DAC '99.

[24]  Tadeusz Sawik,et al.  Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line , 2002, Eur. J. Oper. Res..