Machine scheduling with stochastic release and processing times

Abstract Rapid development of technology provides the foundation for the fourth industrial revolution, namely Industry 4.0. The ability to cope with unpredictable and negative events is becoming increasingly important under Industry 4.0 settings. As scheduling plays an important role in the industry system, stochastic scheduling is therefore a rather hot and interesting research topic. Most existing works assume that the job processing times are stochastic, and rarely consider the release time uncertainty. However, in practice, job release times are usually stochastic as well, due to the various factors. This work considers a parallel machine scheduling problem, in which the processing times and release times are both uncertain. The objective is to minimize the expected total weighted earliness and tardiness in a Just-in-Time (JIT) mode. For the problem, a two-stage stochastic programming formulation is first proposed, and then a classic sample average approximation (SAA) and an improved SAA, combined with scenario reduction, are developed. A case study is conducted to illustrate the applicability of the proposed methods.

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

[2]  J. Dupacová,et al.  Scenario reduction in stochastic programming: An approach using probability metrics , 2000 .

[3]  V. Belvedere,et al.  A quantitative investigation of the role of information and communication technologies in the implementation of a product-service system , 2013 .

[4]  Safia Kedad-Sidhoum,et al.  Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates , 2008, Eur. J. Oper. Res..

[5]  Donya Rahmani,et al.  Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times , 2014 .

[6]  Ching-Jen Huang,et al.  A multi-agent-based negotiation approach for parallel machine scheduling with multi-objectives in an electro-etching process , 2012 .

[7]  Dehua Xu,et al.  Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine , 2011, Comput. Math. Appl..

[8]  Werner Römisch,et al.  A note on scenario reduction for two-stage stochastic programs , 2007, Oper. Res. Lett..

[9]  Jun Lin,et al.  Hedge against total flow time uncertainty of the uniform parallel machine scheduling problem with interval data , 2014 .

[10]  Baoding Liu,et al.  Parallel machine scheduling models with fuzzy processing times , 2004, Inf. Sci..

[11]  Sameer Sharma,et al.  Bi-Objective Scheduling on Parallel Machines in Fuzzy Environment , 2012, SocProS.

[12]  Ming Liu,et al.  Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning , 2015 .

[13]  Alexandre Dolgui,et al.  A sample average approximation method for disassembly line balancing problem under uncertainty , 2014, Comput. Oper. Res..

[14]  Yin-Feng Xu,et al.  Approximation algorithms for parallel machine scheduling with linear deterioration , 2013, Theor. Comput. Sci..

[15]  Zukui Li,et al.  Optimal scenario reduction framework based on distance of uncertainty distribution and output performance: I. Single reduction via mixed integer linear optimization , 2014, Comput. Chem. Eng..

[16]  Talal M. Alkhamis,et al.  Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic , 2012 .

[17]  Gerhard J. Woeginger,et al.  Parallel machine scheduling with nested job assignment restrictions , 2010, Oper. Res. Lett..

[18]  Ching-Jong Liao,et al.  Parallel machine scheduling with preference of machines , 2010 .

[19]  Shimon Y. Nof,et al.  Information systems and knowledge management in industrial engineering: recent advances and new perspectives , 2018 .

[20]  Vitaly A. Strusevich,et al.  Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times , 2015, Math. Program..

[21]  Shih-Wei Lin,et al.  Minimising total weighted earliness and tardiness penalties on identical parallel machines using a fast ruin-and-recreate algorithm , 2016 .

[22]  Ertan Güner,et al.  Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration , 2009, Comput. Oper. Res..

[23]  Erik Hofmann,et al.  Industry 4.0 and the current status as well as future prospects on logistics , 2017, Comput. Ind..

[24]  Savas Balin,et al.  Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation , 2011, Information Sciences.

[25]  Charbel José Chiappetta Jabbour,et al.  Industry 4.0 and the circular economy: a proposed research agenda and original roadmap for sustainable operations , 2018, Annals of Operations Research.

[26]  Alexander Shapiro,et al.  Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications , 2009, J. Optimization Theory and Applications.

[27]  Xian Zhou,et al.  Stochastic scheduling to minimize expected maximum lateness , 2008, Eur. J. Oper. Res..

[28]  Alexandre Dolgui,et al.  Single machine scheduling with precedence constraints and positionally dependent processing times , 2012, Comput. Oper. Res..

[29]  Svetlozar T. Rachev,et al.  Quantitative Stability in Stochastic Programming: The Method of Probability Metrics , 2002, Math. Oper. Res..

[30]  Vishal Gupta,et al.  Robust sample average approximation , 2014, Math. Program..

[31]  Ming Dong,et al.  Parallel machine scheduling with limited controllable machine availability , 2013 .

[32]  Jitka Dupacová,et al.  Scenario reduction in stochastic programming , 2003, Math. Program..

[33]  Z. Caner Taşkın,et al.  A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand , 2018, Int. J. Prod. Res..

[34]  Rubén Ruiz,et al.  A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times , 2011, Eur. J. Oper. Res..

[35]  M. Zandieh,et al.  A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling , 2010 .

[36]  Xiaoqing Xu,et al.  Robust makespan minimisation in identical parallel machine scheduling problem with interval data , 2013 .

[37]  Alexandre Dolgui,et al.  Scheduling of recovery actions in the supply chain with resilience analysis considerations , 2018, Int. J. Prod. Res..

[38]  Alexandre Dolgui,et al.  A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0 , 2016 .

[39]  Fernando Deschamps,et al.  Past, present and future of Industry 4.0 - a systematic literature review and research agenda proposal , 2017, Int. J. Prod. Res..

[40]  Werner Römisch,et al.  Scenario Reduction Algorithms in Stochastic Programming , 2003, Comput. Optim. Appl..

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

[42]  Suk-Jae Jeong,et al.  Parallel machine scheduling with earliness-tardiness penalties and space limits , 2008 .