Job shop scheduling with makespan objective: A heuristic approach

Article history: Received July 2 2013 Received in revised format September 7 2013 Accepted November 23 2013 Available online November 22 2013 Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem. © 2014 Growing Science Ltd. All rights reserved

[1]  Yazid Mati,et al.  A general approach for optimizing regular criteria in the job-shop scheduling problem , 2011, Eur. J. Oper. Res..

[2]  Mario Vanhoucke,et al.  A hybrid single and dual population search procedure for the job shop scheduling problem , 2011, Eur. J. Oper. Res..

[3]  Nhu Binh Ho,et al.  An effective architecture for learning and evolving flexible job-shop schedules , 2007, Eur. J. Oper. Res..

[4]  Orhan Engin,et al.  Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems , 2009, Comput. Ind. Eng..

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

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

[7]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[8]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[9]  Jan Karel Lenstra,et al.  Sequencing by enumerative methods , 1977 .

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

[11]  Guan-Chun Luh,et al.  A multi-modal immune algorithm for the job-shop scheduling problem , 2009, Inf. Sci..

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

[13]  César Rego,et al.  A filter-and-fan approach to the job shop scheduling problem , 2009, Eur. J. Oper. Res..

[14]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[15]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[16]  Frank W. Ciarallo,et al.  Helper-objective optimization strategies for the Job-Shop Scheduling Problem , 2011, Appl. Soft Comput..

[17]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[18]  Ching-Jong Liao,et al.  Ant colony optimization combined with taboo search for the job shop scheduling problem , 2008, Comput. Oper. Res..

[19]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[20]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

[22]  Shi-Jinn Horng,et al.  An efficient job-shop scheduling algorithm based on particle swarm optimization , 2010, Expert Syst. Appl..

[23]  Kamran Zamanifar,et al.  An agent-based parallel approach for the job shop scheduling problem with genetic algorithms , 2010, Math. Comput. Model..

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

[25]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

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

[27]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[28]  Antonin Ponsich,et al.  A hybrid Differential Evolution - Tabu Search algorithm for the solution of Job-Shop Scheduling Problems , 2013, Appl. Soft Comput..

[29]  Cheng Wu,et al.  A hybrid artificial bee colony algorithm for the job shop scheduling problem , 2013 .

[30]  Han Hoogeveen,et al.  Identifying and exploiting commonalities for the job-shop scheduling problem , 2011, Comput. Oper. Res..

[31]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[32]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[33]  R. Nakano,et al.  A fusion of crossover and local search , 1996, Proceedings of the IEEE International Conference on Industrial Technology (ICIT'96).