The stage shop scheduling problem: lower bound and metaheuristic

Remarkable efforts are made to develop the job shop scheduling problem up to now. As a novel generalization, the stage shop can be defined as an environment, in which each job is composed of some stages and each stage may include one operation or more. A stage can be defined a subset of operations of a job, such that these operations can be done in any arbitrary relative order while the stages should be processed in a predetermined order. In other words, the operations of a stage cannot be initiated until all operations of the prior stage are completed. In this paper, an innovative lower bound based on solving the preemptive open shop (using a linear programming model in polynomial time) is devised for the makespan in a stage shop problem. In addition, three metaheuristics, including firefly, harmony search and water wave optimization algorithms are applied to the problem. The results of the algorithms are compared with each other, the proposed lower bound, and a commercial solver.

[1]  Amar Ramudhin,et al.  The generalized Shifting Bottleneck Procedure , 1996 .

[2]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[3]  Mehmet Fatih Tasgetiren,et al.  A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem , 2011, Comput. Ind. Eng..

[4]  Sartaj Sahni,et al.  Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..

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

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

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

[8]  Fariborz Jolai,et al.  A simulation optimisation approach for real-time scheduling in an open shop environment using a composite dispatching rule , 2017, Int. J. Comput. Integr. Manuf..

[9]  Mohammad Mahdi Nasiri,et al.  A pseudo particle swarm optimization for the RCPSP , 2013 .

[10]  Frank Werner,et al.  Complexity of mixed shop scheduling problems: A survey , 2000, Eur. J. Oper. Res..

[11]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

[12]  Thatchai Thepphakorn,et al.  Application of Firefly Algorithm and Its Parameter Setting for Job Shop Scheduling , 2012 .

[13]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[14]  Mohammad Mahdi Nasiri,et al.  A hybrid scatter search for the partial job shop scheduling problem , 2011 .

[15]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[16]  Alexander Kononov,et al.  A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job , 2016, J. Sched..

[17]  Lale Özbakır,et al.  Mathematical models for job-shop scheduling problems with routing and process plan flexibility , 2010 .

[18]  Frank Werner,et al.  Flexible job shop scheduling with lot streaming and sublot size optimisation , 2018, Int. J. Prod. Res..

[19]  Frank Werner,et al.  Approaches to modeling train scheduling problems as job-shop problems with blocking constraints , 2018, J. Sched..

[20]  Xinyu Shao,et al.  More MILP models for integrated process planning and scheduling , 2016 .

[21]  Mohammad Mahdi Nasiri,et al.  A GA/TS algorithm for the stage shop scheduling problem , 2011, Comput. Ind. Eng..

[22]  Marcus Ritt,et al.  An effective heuristic algorithm for the partial shop scheduling problem , 2018, Comput. Oper. Res..

[23]  Zong Woo Geem,et al.  Metaheuristics in structural optimization and discussions on harmony search algorithm , 2016, Swarm Evol. Comput..

[24]  Hyoung-Ho Doh,et al.  A priority scheduling approach for flexible job shops with multiple process plans , 2013 .

[25]  Xin-She Yang,et al.  Firefly algorithm with chaos , 2013, Commun. Nonlinear Sci. Numer. Simul..

[26]  K. Chandrasekaran,et al.  Network and reliability constrained unit commitment problem using binary real coded firefly algorithm , 2012 .

[27]  John Stufken,et al.  Taguchi Methods: A Hands-On Approach , 1992 .

[28]  Yujun Zheng.  Water wave optimization: A new nature-inspired metaheuristic , 2015, Comput. Oper. Res..

[29]  Seyed Taghi Akhavan Niaki,et al.  Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: Two calibrated meta-heuristic algorithms , 2013 .

[30]  Michele Lanzetta,et al.  Hybrid stage shop scheduling , 2015, Expert Syst. Appl..

[31]  Tamás Kis,et al.  Job-shop scheduling with processing alternatives , 2003, Eur. J. Oper. Res..

[32]  Mohammad Mahdi Nasiri,et al.  A modified ABC algorithm for the stage shop scheduling problem , 2015, Appl. Soft Comput..

[33]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..