Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed a two-objective model to solve JSP with sequence-dependent setup times (SDST). Considering SDST and optimizing of the both objectives simultaneously (makespan and maximum tardiness) bring us closer to natural-world problems. The e-constraint method is applied to solve the mentioned two-objective model. A set of numerical data is generated and tested to validate the model’s efficiency and flexibility. The developed model can efficiently use for solving JSPs in the real world, especially for manufacturing companies with having setup and delivery time’s constraints.

[1]  M. Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities , 2014 .

[2]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[3]  Nasr Al-Hinai,et al.  An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem , 2011 .

[4]  Sanja Petrovic,et al.  Fuzzy job shop scheduling with lot-sizing , 2008, Ann. Oper. Res..

[5]  Bernd Scholz-Reiter,et al.  Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem , 2016, J. Sched..

[6]  Camino R. Vela,et al.  Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times , 2012, Journal of Intelligent Manufacturing.

[7]  D. Harrison,et al.  The Application of Parallel Multipopulation Genetic Algorithms to Dynamic Job-Shop Scheduling , 2000 .

[8]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

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

[10]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[11]  James S. Noble,et al.  An approach to job shop scheduling with sequence-dependent setups , 1999 .

[12]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[13]  M. Mousakhani,et al.  Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness , 2013 .

[14]  Mohamed Kurdi,et al.  An effective new island model genetic algorithm for job shop scheduling problem , 2016, Comput. Oper. Res..

[15]  Cemal Özgüven,et al.  Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times , 2012 .

[16]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[17]  Christian Bierwirth,et al.  An efficient genetic algorithm for job shop scheduling with tardiness objectives , 2004, Eur. J. Oper. Res..

[18]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

[19]  A. Azab,et al.  Modeling and heuristics for scheduling of distributed job shops , 2014, Expert Syst. Appl..

[20]  Ajai Jain,et al.  Performance analysis of dispatching rules in a stochastic dynamic job shop manufacturing system with sequence-dependent setup times: Simulation approach , 2015 .

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

[22]  M. Zandieh,et al.  Scheduling sequence-dependent setup time job shops with preventive maintenance , 2009 .

[23]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

[24]  Tarek Y. ElMekkawy,et al.  Robust and stable flexible job shop scheduling with random machine breakdowns using a hybrid genetic algorithm , 2011 .

[25]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[26]  Parviz Fattahi,et al.  Hybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage , 2017 .

[27]  S. F. Fatemi Ghomi,et al.  Scheduling job shop problems with sequence-dependent setup times , 2009 .

[28]  M. Zandieh,et al.  Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach , 2011 .

[29]  Christian Bierwirth,et al.  A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective , 2016, Comput. Oper. Res..