An Improved Algorithm for Minimizing Makespan on Flowshops with Uncertain Processing Times

We address the four-machine flowshop scheduling problem with the objective of minimizing makespan with uncertain processing times The problem was investigated in the literature (RAIRO Operations Research 54, 529-553) and different algorithms were proposed. In this paper, we propose a new algorithm for the problem. The new proposed algorithm is compared with the best existing algorithm in the literature by using extensive computational experiments. Computational experiments show that the new proposed algorithm performs much better than the best existing algorithm in the literature in terms of error while both have the same computational time. Specifically, the new proposed algorithm reduces the error of the best existing algorithm in the literature about 40%. This result has been confirmed by using hypotheses testing with a significance level of 0.01.

[1]  Ali Allahverdi,et al.  Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan , 2020, RAIRO Oper. Res..

[2]  Ali Allahverdi,et al.  Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness , 2018 .

[3]  Socorro Rangel,et al.  A survey of case studies in production scheduling: Analysis and perspectives , 2017, J. Comput. Sci..

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

[5]  Ali Allahverdi,et al.  Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times , 2017 .

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

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

[8]  Hlynur Stefansson,et al.  Production , Manufacturing and Logistics Discrete and continuous time representations and mathematical models for large production scheduling problems : A case study from the pharmaceutical industry , 2011 .

[9]  Amine Mahjoub,et al.  Scheduling with uncertainties on new computing platforms , 2011, Comput. Optim. Appl..

[10]  Ali Allahverdi,et al.  Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times , 2010 .

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

[12]  Ali Allahverdi,et al.  Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time , 2010, Comput. Math. Appl..

[13]  Ali Allahverdi,et al.  Flowshop scheduling problem to minimize total completion time with random and bounded processing times , 2004, J. Oper. Res. Soc..

[14]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[15]  Ali Allahverdi,et al.  Two–machine flowshop minimum–length scheduling problem with random and bounded processing times , 2003 .

[16]  Ali Allahverdi,et al.  The Tricriteria Two-Machine Flowshop Scheduling Problem , 2001 .

[17]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

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