A New Class of Greedy Heuristics for Job Shop Scheduling Problems

In this paper we introduce a new class of greedy heuristics for general job shop scheduling problems. In particular we deal with the classical job shop, i.e. with unlimited capacity buffer, and job shop problems with blocking and no-wait. The proposed algorithm family is a simple randomized greedy family based on a general formulation of the job shop problem. We report on an extensive study of the proposed algorithms, and comparisons with other greedy algorithms are presented.

[1]  Yih-Long Chang,et al.  Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment , 1996 .

[2]  Frank Werner,et al.  Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..

[3]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[4]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[5]  J. Carlier.  The one-machine sequencing problem , 1982 .

[6]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[7]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

[8]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[9]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[10]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[11]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[12]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[15]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[16]  Dario Pacciarelli,et al.  Machine Scheduling via Alternative Graphs , 2000 .

[17]  E. Balas,et al.  The one-machine problem with delayed precedence constraints and its use in job shop scheduling , 1995 .

[18]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

[19]  Mauro Dell'Amico,et al.  Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..

[20]  Dario Pacciarelli,et al.  Train Scheduling in a Regional Railway Network , 2001 .

[21]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[22]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..