Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems
- 420 Downloads
Flexible job shop scheduling in uncertain environments plays an important part in real-world manufacturing systems. With the aim of capturing the uncertain and multi-objective nature of flexible job shop scheduling, a mathematical model for the multi-objective stochastic flexible job shop scheduling problem (MOSFJSSP) is constructed, where three objectives of make-span, maximal machine workload, and robustness to uncertainties are considered simultaneously under a variety of practical constraints. Two new scenario-based robustness measures are defined based on statistical tools. To solve MOSFJSSP appropriately, a modified multi-objective evolutionary algorithm based on decomposition (m-MOEA/D) is developed for robust scheduling. The novelty of our approach is that it adopts a new subproblem update method which exploits the global information, allows the elitists kept in an archive to participate in the child generation, employs a subproblem selection and suspension strategy to focus more computational efforts on promising subproblems, and incorporates problem-specific genetic operators for variation. Extensive experimental results on 18 problem instances, including 8 total flexible and 10 partial flexible instances, show that the two new robustness measures are more effective than the existing scenario-based measures, in improving the schedule robustness to uncertainties and maintaining a small variance of disrupted objective values. Compared to the state-of-the-art multi-objective optimization evolutionary algorithms (MOEAs), our proposed m-MOEA/D-based robust scheduling approach achieves a much better convergence performance. Different trade-offs among the three objectives are also analyzed.
KeywordsMetaheuristics Robust scheduling Multi-objective optimization evolutionary algorithms Robust measures
This work is supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 61502239 and 61503191, Natural Science Foundation of Jiangsu Province of China under Grant Nos. BK20150924 and BK20150933, and Qing Lan Project of Jiangsu Province of China.
Compliance with ethical standards
Conflict of interest
Disclosure of potential conflicts of interest.
Humans and animal rights
Research involving human participants and/or animals.
- Abbass HA, Bender A, Dam HH, Baker S, Whitacre J, Sarker R (2008) Computational scenario-based capability planning. In: Proceedings of the 10th annual conference on genetic and evolutionary computation. New York, NY, USA, pp 1437–1444Google Scholar
- Al-Hinai N, ElMekkawy TY (2012) Solving the flexible job shop scheduling problem with uniform processing time uncertainty. World Acad Sci Eng Technol 64:996–1001Google Scholar
- Chang P, Chen S, Zhang Q, Lin J (2008) MOEA/D for flowshop scheduling problems. IEEE congress on evolutionary computation (CEC 2008). IEEE Press, HongKong, pp 1433–1438Google Scholar
- Ghosh S (1996) Guaranteeing fault tolerance through scheduling in real-time systems. Ph.D. thesis. University of PittsburghGoogle Scholar
- Ghosh S, Melhem R, Mosse D (1995) Enhancing real-time schedules to tolerate transient faults. In: IEEE real-time systems symposium. IEEE Press, pp 120–129Google Scholar
- Jourdan L, Talbi E (2007) Combinatorial optimization of stochastic multi-objective problems: an application to the flow-shop scheduling problem. In: Evolutionary multi-criterion optimization, Lecture Notes in Computer Science, vol 4403. Matsushima, Japan, pp 457–471Google Scholar
- Rahmani D, Heydari M (2013) Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. J Manuf Syst 33(1):82–94Google Scholar
- Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization. Master’s thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MassachusettsGoogle Scholar
- Ullah S, LIU Q, Zhang C, Awan YR (2009) Scheduling with uncertain processing times: applying \(\beta \)-robust schedule on two-machine flow-shop with constraints. In: IEEE International conference on industrial engineering and engineering management (IEEM 2009). IEEE Press, Hong Kong, pp 1946–1950Google Scholar
- Van Veldhuizen DA, Lamont GB (1999) Multiobjective evolutionary algorithm test suites. In: Proceedings of 1999 ACM symposium on applied computing. ACM Press, pp 351–357Google Scholar
- Xiong J, Liu J, Chen Y, Abbass HA (2011) An evolutionary multi-objective scenario-based approach for stochastic resource investment project scheduling. In: 2011 IEEE Congress on Evolutionary Computation (CEC 2011). IEEE Press, New Orleans, LA, USA, pp 2767–2774Google Scholar
- Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. In: ParallelProblem solving from nature (PPSN VIII). Lecture Notes in ComputerScience 3242, Springer, Birmingham, pp 832–842Google Scholar
- Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. In: Proceedings of IEEE congress on evolutionary computation. IEEE Press, Trondheim, pp 203–208Google Scholar
- Zhang G, Zhu H, Zhang C (2011) Hybrid intelligent algorithm for flexible job-shop scheduling problem under uncertainty. In: Advances in reinforcement learning, InTechOpen, pp 361–370, ISBN: 978-953-307-369-9Google Scholar