Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness

We consider the two-machine no-wait flowshop scheduling problem to minimize maximum lateness, where setup times are considered separate from processing times. Moreover, setup times are uncertain (within some intervals), where only lower and upper bounds are known. The objective is to obtain a set of dominating schedules, which contain the optimal solution. The size of dominating set can be reduced by the development of dominance relations. In this paper, we establish local and global dominance relations. Furthermore, we provide examples to illustrate how the developed dominance relations either help in finding the optimal schedule or in reducing the size of dominating set. Moreover, we establish an algorithm to find the number of developed dominance relations for given input parameters. Computational experiments indicate that the established dominance relations are helpful in reducing the size of dominating schedules.

[1]  Frank Werner,et al.  Optimal makespan scheduling with given bounds of processing times , 1997 .

[2]  T. C. Edwin Cheng,et al.  Two-Machine Flow-Shop Minimum-Length Scheduling with Interval Processing Times , 2009, Asia Pac. J. Oper. Res..

[3]  Yeong-Dae Kim,et al.  Minimizing total tardiness in a two-machine flowshop scheduling problem with availability constraint on the first machine , 2017, Comput. Ind. Eng..

[4]  Ali Allahverdi,et al.  Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times , 2010, Comput. Math. Appl..

[5]  Dechang Pi,et al.  Self-adaptive discrete invasive weed optimization for the blocking flow-shop scheduling problem to minimize total tardiness , 2017, Comput. Ind. Eng..

[6]  Ali Allahverdi,et al.  A survey of scheduling problems with no-wait in process , 2016, Eur. J. Oper. Res..

[7]  Sujit K. Dutta,et al.  Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop , 1973 .

[8]  Tian Chen,et al.  An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects , 2018, Inf. Sci..

[9]  R. Macchiaroli,et al.  Modelling and optimization of industrial manufacturing processes subject to no-wait constraints , 1999 .

[10]  Jerzy Kamburowski,et al.  A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation , 2006, Eur. J. Oper. Res..

[11]  Daniele Ferone,et al.  A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times , 2017, Simul. Model. Pract. Theory.

[12]  Jose M. Framiñan,et al.  Order scheduling with tardiness objective: Improved approximate solutions , 2018, Eur. J. Oper. Res..

[13]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[14]  Ali Allahverdi.  Two-machine flowshop scheduling problem to minimize total completion time with bounded setup and processing times , 2006 .

[15]  Dan Trietsch,et al.  Johnson's problem with stochastic processing times and optimal service level , 2006, Eur. J. Oper. Res..

[16]  Dan Trietsch,et al.  Makespan-related criteria for comparing schedules in stochastic environments , 1998, J. Oper. Res. Soc..

[17]  Yu. N. Sotskova,et al.  Uncertainty measure for the Bellman–Johnson problem with interval processing times , 2012 .

[18]  Ali Allahverdi,et al.  The third comprehensive survey on scheduling problems with setup times/costs , 2015, Eur. J. Oper. Res..

[19]  L. Puigjaner,et al.  An Efficient Mixed-Integer Linear Programming Scheduling Framework for Addressing Sequence-Dependent Setup Issues in Batch Plants , 2009 .

[20]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[21]  Ik Sun Lee,et al.  Minimizing total tardiness for the order scheduling problem , 2013 .

[22]  Kai Wang,et al.  A decomposition-based approach to flexible flow shop scheduling under machine breakdown , 2012 .

[23]  Wei Li,et al.  An improved heuristic for no-wait flow shop to minimize makespan , 2017 .

[24]  Yuri N. Sotskov,et al.  Minimizing total weighted flow time of a set of jobs with interval processing times , 2009, Math. Comput. Model..

[25]  Prabuddha De,et al.  On the minimization of the weighted number of tardy jobs with random processing times and deadline , 1991, Comput. Oper. Res..

[26]  Christos Koulamas,et al.  New index priority rules for no-wait flow shops , 2018, Comput. Ind. Eng..

[27]  Frank Werner,et al.  The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times , 2011 .

[28]  Joseph S. B. Mitchell,et al.  Scheduling Aircraft to Reduce Controller Workload , 2009, ATMOS.

[29]  Shun-Chen Niu,et al.  On Johnson's Two-Machine Flow Shop with Random Processing Times , 1986, Oper. Res..

[30]  Cerry M. Klein,et al.  Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models , 2005, Comput. Ind. Eng..

[31]  Yuri N. Sotskov,et al.  Schedule execution for two-machine flow-shop with interval processing times , 2009, Math. Comput. Model..

[32]  Oliver Braun,et al.  Stability of Johnson's schedule with respect to limited machine availability , 2002 .

[33]  H. M. Soroush,et al.  Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem , 2007, Eur. J. Oper. Res..

[34]  Yuri N. Sotskov,et al.  Minimizing total weighted flow time under uncertainty using dominance and a stability box , 2012, Comput. Oper. Res..

[35]  T.-C. Lai,et al.  Sequencing with uncertain numerical data for makespan minimisation , 1999, J. Oper. Res. Soc..

[36]  Ali Allahverdi,et al.  TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN OR TOTAL COMPLETION TIME WITH RANDOM AND BOUNDED SETUP TIMES , 2003 .

[37]  Shih-Wei Lin,et al.  Minimizing makespan for no-wait flowshop scheduling problems with setup times , 2018, Comput. Ind. Eng..

[38]  Y. Sotskov,et al.  Partial job order for solving the two-machine flow-shop minimum-length problem with uncertain processing times , 2009 .

[39]  Erhan Kozan,et al.  Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model , 2011, Transp. Sci..

[40]  H. M. Soroush,et al.  Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs , 1999, Eur. J. Oper. Res..

[41]  A. Allahverdi.  THREE-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH BOUNDED SETUP AND PROCESSING TIMES , 2008 .

[42]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[43]  Vernon Ning Hsu,et al.  Scheduling patients in an ambulatory surgical center , 2003 .

[44]  Ali Allahverdi,et al.  Production in a two-machine flowshop scheduling environment with uncertain processing and setup times to minimize makespan , 2015 .

[45]  S. C. Kim,et al.  Scheduling jobs with uncertain setup times and sequence dependency , 1997 .

[46]  Ali Allahverdi,et al.  Total flowtime in no-wait flowshops with separated setup times , 1998, Comput. Oper. Res..

[47]  Ali Allahverdi,et al.  Increasing the profitability and competitiveness in a production environment with random and bounded setup times , 2013 .

[48]  Thomas Becker,et al.  Application of a modified GA, ACO and a random search procedure to solve the production scheduling of a case study bakery , 2014, Expert Syst. Appl..