A comparative analysis of job scheduling algorithm

For complexity, randomness and dynamic characteristics, job scheduling problem is well known as NP-hard, and a lot of research about scheduling algorithms was conducted in the past. In this paper, the definition and classification of job scheduling problem are firstly given, and then a systematic and complete comparative analysis of job scheduling algorithms is carried out from the aspects of origin, characteristics, computation and application. Finally, some development trends and characteristics of job scheduling algorithms are proposed.

[1]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[2]  Shu-Cherng Fang,et al.  An Electromagnetism-like Mechanism for Global Optimization , 2003, J. Glob. Optim..

[3]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[4]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

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

[6]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[7]  Peter Brucker,et al.  A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[8]  Guoji Zhang,et al.  A Hybrid PSO/GA Algorithm for Job Shop Scheduling Problem , 2010, ICSI.

[9]  M. Chandrasekaran,et al.  Solving job shop scheduling problems using artificial immune system , 2006 .

[10]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[11]  Jigui Sun,et al.  An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem , 2009, Expert Syst. Appl..

[12]  Burak Eksioglu,et al.  A tabu search algorithm for the flowshop scheduling problem with changing neighborhoods , 2008, Comput. Ind. Eng..

[13]  Ihsan Sabuncuoglu,et al.  A neural network model for scheduling problems , 1996 .

[14]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.

[15]  Zong Woo Geem,et al.  Harmony Search Applications in Industry , 2008, Soft Computing Applications in Industry.

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

[17]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[18]  Wing-Keung Wong,et al.  A genetic-algorithm-based optimization model for scheduling flexible assembly lines , 2008 .

[19]  L. P. Khoo,et al.  An immune algorithm approach to the scheduling of a flexible PCB flow shop , 2003 .

[20]  Reza Tavakkoli-Moghaddam,et al.  A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness , 2009, Soft Comput..

[21]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[22]  Congxin Li,et al.  Research on immune genetic algorithm for solving the job-shop scheduling problem , 2007 .

[23]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[24]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[25]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[26]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..