A Chance Constrained Programming Approach for No-Wait Flow Shop Scheduling Problem under the Interval-Valued Fuzzy Processing Time

This work focuses on the study of robust no-wait flow shop scheduling problem (R-NWFSP) under the interval-valued fuzzy processing time, which aims to minimize the makespan within an upper bound on total completion time. As the uncertainty of actual job processing times may cause significant differences in processing costs, a R-NWFSP model whose objective function involves interval-valued fuzzy sets (IVFSs) is proposed, and an improved SAA is designed for its efficient solution. Firstly, based on the credibility measure, chance constrained programming (CCP) is utilized to make the deterministic transformation of constraints. The uncertain NWFSP is transformed into an equivalent deterministic linear programming model. Then, in order to tackle the deterministic model efficiently, a simulated annealing algorithm (SAA) is specially designed. A powerful neighborhood search method and new acceptance criterion are applied to find better solutions. Numerical computations demonstrate the high efficiency of the SAA. In addition, a sensitivity analysis convincingly shows that the applicability of the proposed model and its solution strategy under interval-valued fuzzy sets.

[1]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[2]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[3]  Fardin Ahmadizar,et al.  Minimizing makespan in a group shop with fuzzy release dates and processing times , 2012, The International Journal of Advanced Manufacturing Technology.

[4]  Marcelo Seido Nagano,et al.  A new evolutionary clustering search for a no-wait flow shop problem with set-up times , 2012, Eng. Appl. Artif. Intell..

[5]  Sartaj Sahni,et al.  Complexity of Scheduling Shops with No Wait in Process , 1979, Math. Oper. Res..

[6]  Manoranjan Maiti,et al.  A method to solve linear programming problem with interval type-2 fuzzy parameters , 2018, Fuzzy Optimization and Decision Making.

[7]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[8]  Ali Allahverdi,et al.  No-wait flowshop scheduling problem with two criteria; total tardiness and makespan , 2018, Eur. J. Oper. Res..

[9]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[10]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[11]  Reza Tavakkoli-Moghaddam,et al.  A new weighted distance-based approximation methodology for flow shop scheduling group decisions under the interval-valued fuzzy processing time , 2020, Appl. Soft Comput..

[12]  Ali Allahverdi,et al.  Single machine scheduling problem with interval processing times to minimize mean weighted completion time , 2014, Comput. Oper. Res..

[13]  Ali Allahverdi,et al.  A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times , 2013 .

[14]  Rong-Hwa Huang,et al.  No-wait two-stage multiprocessor flow shop scheduling with unit setup , 2009 .

[15]  A. Charnes,et al.  Chance-Constrained Programming , 1959 .

[16]  Jordi Pereira,et al.  The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective , 2016, Comput. Oper. Res..

[17]  Panos M. Pardalos,et al.  A robust dynamic scheduling approach based on release time series forecasting for the steelmaking-continuous casting production , 2020, Appl. Soft Comput..

[18]  Yi Zhang,et al.  A discrete Water Wave Optimization algorithm for no-wait flow shop scheduling problem , 2018, Expert Syst. Appl..

[19]  Quan-Ke Pan,et al.  Evolutionary multi-objective blocking lot-streaming flow shop scheduling with interval processing time , 2016, Appl. Soft Comput..

[20]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[21]  M. Chandrasekaran,et al.  Application of Firefly Algorithm in Job Shop Scheduling Problem for Minimization of Makespan , 2014 .

[22]  Dechang Pi,et al.  Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem , 2020, Swarm Evol. Comput..

[23]  Fengshan Bai,et al.  No-wait flexible flowshop scheduling with no-idle machines , 2005, Oper. Res. Lett..

[24]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[25]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[26]  Guo-Sheng Liu,et al.  Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time , 2017 .

[27]  Ahmad Makui,et al.  Extension of fuzzy TOPSIS method based on interval-valued fuzzy sets , 2009, Appl. Soft Comput..

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

[29]  Marjan Mernik,et al.  Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them , 2014, Appl. Soft Comput..

[30]  Chung-Cheng Lu,et al.  Minimizing worst-case regret of makespan on a single machine with uncertain processing and setup times , 2014, Appl. Soft Comput..

[31]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[32]  Iraj Mahdavi,et al.  A bi-objective possibilistic programming model for open shop scheduling problems with sequence-dependent setup times, fuzzy processing times, and fuzzy due dates , 2012, Appl. Soft Comput..

[33]  Dvir Shabtay,et al.  The just-in-time scheduling problem in a flow-shop scheduling system , 2012, Eur. J. Oper. Res..