Performance measurement of selected heuristic algorithms for solving scheduling problems

The problem of scheduling in a Flow Shop is considered with the objective of minimizing the makespan for static problems. This paper compares the most common heuristics methods, namely CDS, Palmer's Slope index, Gupta's algorithm and so called MOD algorithm, for scheduling on the variety size of problem data sets and their impact on CPU time. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation with the boundaries to the reference heuristic, namely NEH algorithm. Computational experiments are conducted to evaluate the impact of scheduling problem datasets of n-job and m-machine in flow-shop on CPU time.

[1]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[2]  Jeffrey W. Herrmann,et al.  Handbook of production scheduling , 2006 .

[3]  R. S. Lashkari,et al.  Selection of scheduling rules in FMSs—A simulation approach , 1991 .

[4]  Jozef Novak-Marcincin,et al.  Effective utilization of rapid prototyping technology , 2012 .

[5]  Yih-Long Chang,et al.  A new heuristic for the n-job, M-machine flow-shop problem , 1991 .

[6]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[7]  Vladimir Modrak,et al.  Alternative Heuristic Algorithm for Flow Shop Scheduling Problem , 2012 .

[8]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[9]  Kien Ming Ng,et al.  A water-flow algorithm for flexible flow shop scheduling with intermediate buffers , 2011, J. Sched..

[10]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[11]  Vladimír Modrák,et al.  Mapping Development of MES Functionalities , 2009, ICINCO-SPSMC.

[12]  E. S. Page.  An Approach to the Scheduling of Jobs on Machines , 1961 .

[13]  Ching-Jong Liao,et al.  An ant colony system for permutation flow-shop sequencing , 2004, Comput. Oper. Res..

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

[15]  Henry Laurence Gantt,et al.  Organizing for work , 1919 .

[16]  Dupont de Dinechin.  Time-Indexed Formulations and a Large Neighborhood Search for the Resource-Constrained Modulo Scheduling Problem , 2007 .

[17]  Bronislav Chramcov,et al.  Modelling and Simulation of the Order Realization in the Serial Production System , 2011 .

[18]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[19]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[20]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[21]  Józef Grabowski,et al.  Sequencing of jobs in some production system , 2000, Eur. J. Oper. Res..

[22]  W. Bodmer.  Principles of Scientific Management , 1993, FASEB journal : official publication of the Federation of American Societies for Experimental Biology.

[23]  E. Nowicki,et al.  A fast tabu search algorithm for the permutation flow-shop problem , 1996 .

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

[25]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[26]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.