Advertisement

Modeling and solving for bi-objective cutting parallel machine scheduling problem

  • Ronghua Meng
  • Yunqing RaoEmail author
  • Qiang Luo
S.I.: Project Management and Scheduling 2018
  • 26 Downloads

Abstract

This paper addresses a bi-objective cutting parallel machine scheduling problem aiming to minimize the total makespan and total tardiness. This problem is inspired from a structural metal-cutting plant that combines identical and unrelated parallel machine scheduling problems. To formulate this complicated problem, a new mixed-integer programming (MIP) model is presented in consideration of total makespan and total tardiness. The machine-job-dependent processing times are considered along with the setup times, pickup times, different delivery times, and machine eligibility constraints. Owing to the complex characteristics of the problem, an appropriate non-dominated sorting Genetic Algorithm III (NSGAIII) with an embedded variable neighborhood structure strategy (VNSGAIII) is developed. A number of randomly generated datasets are used to test the performance of VNSGAIII in comparison with NSGAII, and NSGAIII on solving the engineering problem addressed herein. The experimental results demonstrate that the suggested VNSGAIII statistically outperforms the compared algorithms, especially in the distribution of Pareto solutions. The ε-constrained method is implemented in the direct MIP model by CPLEX for comparison with the proposed evolutionary algorithms. The proposed algorithm performs efficiently when obtaining the Pareto solutions.

Keywords

Parallel machine scheduling problem NSGA III Bi-objective problem Makespan Tardiness 

Notes

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant No. 51675206); the open fund project of the Hubei Key Laboratory of Hydroelectric Machinery Design & Maintenance (Grant No. 2017KJX10) and the new intelligent manufacturing models for rail transit shield machine funded by Ministry of Industry and Information Technology of China. All supports are gratefully acknowledged.

References

  1. Alem, D. J., Munari, P. A., Arenales, M. N., et al. (2010). On the cutting stock problem under stochastic demand. Annals of Operations Research, 179(1), 169–186.CrossRefGoogle Scholar
  2. Allahverdi, A., Ng, C. T., Cheng, T. C. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.  https://doi.org/10.1016/j.ejor.2006.06.060.CrossRefGoogle Scholar
  3. Asefi, H., Jolai, F., Rabiee, M., & Tayebi Araghi, M. E. (2014). A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. The International Journal of Advanced Manufacturing Technology, 75(5–8), 1017–1033.  https://doi.org/10.1007/s00170-014-6177-9.CrossRefGoogle Scholar
  4. Berrichi, A., Amodeo, L., Yalaoui, F., Châtelet, E., & Mezghiche, M. (2008). Bi-objective optimization algorithms for joint production and maintenance scheduling: application to the parallel machine problem. Journal of Intelligent Manufacturing, 20(4), 389–400.  https://doi.org/10.1007/s10845-008-0113-5.CrossRefGoogle Scholar
  5. Chang, P. C., Chen, S. H., Fan, C. Y., & Chan, C. L. (2008). Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems. Applied Mathematics and Computation, 205(2), 550–561.  https://doi.org/10.1016/j.amc.2008.05.027.CrossRefGoogle Scholar
  6. Cheng, T. C. E. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 21.CrossRefGoogle Scholar
  7. Cheng, C. Y., & Huang, L. W. (2017). Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control. Journal of Manufacturing Systems, 42, 1–10.  https://doi.org/10.1016/j.jmsy.2016.10.005.CrossRefGoogle Scholar
  8. Deb, K. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 16.CrossRefGoogle Scholar
  9. Deb, K., & Jain, H. (2014). An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation, 18(4), 577–601.  https://doi.org/10.1109/tevc.2013.2281535.CrossRefGoogle Scholar
  10. Fleszar, K., & Hindi, K. S. (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search. European Journal of Operational Research, 155(2), 402–413.  https://doi.org/10.1016/s0377-2217(02)00884-6.CrossRefGoogle Scholar
  11. Giannelos, N. F., & Georgiadis, M. C. (2001). Scheduling of cutting-stock processes on multiple parallel machines. Chemical Engineering Research and Design, 79(7), 747–753.CrossRefGoogle Scholar
  12. González, M. A., Palacios, J. J., Vela, C. R., & Hernández-Arauzo, A. (2017). Scatter search for minimizing weighted tardiness in a single machine scheduling with setups. Journal of Heuristics, 23(2–3), 81–110.  https://doi.org/10.1007/s10732-017-9325-1.CrossRefGoogle Scholar
  13. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.CrossRefGoogle Scholar
  14. Hamzadayi, A., & Yildiz, G. (2017). Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Computers & Industrial Engineering, 106, 287–298.  https://doi.org/10.1016/j.cie.2017.02.013.CrossRefGoogle Scholar
  15. Jain, H., & Deb, K. (2014). An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: Handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation, 18(4), 602–622.  https://doi.org/10.1109/tevc.2013.2281534.CrossRefGoogle Scholar
  16. Ji, B., Yuan, X., & Yuan, Y. (2017). Orthogonal design-based NSGA-III for the optimal lockage co-scheduling problem. IEEE Transactions on Intelligent Transportation Systems, 18(8), 2085–2095.  https://doi.org/10.1109/tits.2016.2630718.CrossRefGoogle Scholar
  17. Kallrath, J., Rebennack, S., Kallrath, J., & Kusche, R. (2014). Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges. European Journal of Operational Research, 238(1), 374–389.CrossRefGoogle Scholar
  18. Kim, D. W., Na, D. G., & Frank Chen, F. (2003). Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer-Integrated Manufacturing, 19(1–2), 173–181.  https://doi.org/10.1016/s0736-5845(02)00077-7.CrossRefGoogle Scholar
  19. Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.CrossRefGoogle Scholar
  20. Liao, T. W., & Su, P. (2017). Parallel machine scheduling in fuzzy environment with hybrid ant colony optimization including a comparison of fuzzy number ranking methods in consideration of spread of fuzziness. Applied Soft Computing, 56, 65–81.  https://doi.org/10.1016/j.asoc.2017.03.004.CrossRefGoogle Scholar
  21. Liaw, C. F., Lin, Y. K., Cheng, C. Y., & Chen, M. (2003). Scheduling unrelated parallel machines to minimize total weighted tardiness. Computers & Operations Research, 30(12), 1777–1789.  https://doi.org/10.1016/s0305-0548(02)00105-3.CrossRefGoogle Scholar
  22. Mavrotas, G. (2009). Effective implementation of the ε-constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation, 213(2), 455–465.CrossRefGoogle Scholar
  23. Melega, G. M., de Araujo, S. A., & Jans, R. (2018). Classification and literature review of integrated lot-sizing and cutting stock problems. European Journal of Operational Research, 271(1), 1–19.CrossRefGoogle Scholar
  24. Meng, L., Zhang, C., Shao, X., & Ren, Y. (2019). MILP models for energy-aware flexible job shop scheduling problem. Journal of Cleaner Production, 210, 710–723.CrossRefGoogle Scholar
  25. Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 4.Google Scholar
  26. Mobasher, A., & Ekici, A. (2013). Solution approaches for the cutting stock problem with setup cost. Computers & Operations Research, 40(1), 225–235.CrossRefGoogle Scholar
  27. Mokotoff, E. (2001). Parallel-machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18, 50.Google Scholar
  28. Pan, C. H., & Su, C. S. (2015). Two parallel machines problem with job delivery coordination and availability constraint. Annals of Operations Research, 235(1), 653–664.CrossRefGoogle Scholar
  29. Pan, Q. K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36(8), 2498–2511.  https://doi.org/10.1016/j.cor.2008.10.008.CrossRefGoogle Scholar
  30. Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research.  https://doi.org/10.1007/s10479-017-2481-8.Google Scholar
  31. Rabadi, G., Moraga, R. J., & Al-Salem, A. (2006). Heuristics for the unrelated parallel machine scheduling problem with setup times. Journal of Intelligent Manufacturing, 17(1), 85–97.CrossRefGoogle Scholar
  32. Rajkanth, R., Rajendran, C., & Ziegler, H. (2016). Heuristics to minimize the completion time variance of jobs on a single machine and on identical parallel machines. The International Journal of Advanced Manufacturing Technology, 88(5–8), 1923–1936.  https://doi.org/10.1007/s00170-016-8879-7.Google Scholar
  33. Root, J. G. (1965). Scheduling with deadlines and loss functions on k parallel machines. Management Science, 11(3), 460–475.CrossRefGoogle Scholar
  34. Ruiz, R., Maroto, C., & Alcaraz, J. (2006). Two new robust genetic algorithms for the flowshop scheduling problem. Omega, 34(5), 461–476.  https://doi.org/10.1016/j.omega.2004.12.006.CrossRefGoogle Scholar
  35. Sadati, A., Tavakkoli-Moghaddam, R., Naderi, B., & Mohammadi, M. (2017). Solving a new multi-objective unrelated parallel machines scheduling problem by hybrid teaching-learning based optimization. International Journal of Engineering, 30(2), 10.  https://doi.org/10.5829/idosi.ije.2017.30(02b).Google Scholar
  36. Shahvari, O., & Logendran, R. (2017). An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Computers & Operations Research, 77, 154–176.  https://doi.org/10.1016/j.cor.2016.07.021.CrossRefGoogle Scholar
  37. Shim, S.-O., & Kim, Y.-D. (2007). Scheduling on parallel identical machines to minimize total tardiness. European Journal of Operational Research, 177(1), 135–146.  https://doi.org/10.1016/j.ejor.2005.09.038.CrossRefGoogle Scholar
  38. Tang, L., Zhao, X., Liu, J., & Leung, J. Y. T. (2017). Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine. European Journal of Operational Research, 263(2), 401–411.  https://doi.org/10.1016/j.ejor.2017.05.019.CrossRefGoogle Scholar
  39. Tseng, C.-T., Lee, C.-H., Chiu, Y.-S. P., & Lu, W.-T. (2016). A discrete electromagnetism-like mechanism for parallel machine scheduling under a grade of service provision. International Journal of Production Research, 55(11), 3149–3163.  https://doi.org/10.1080/00207543.2016.1265683.CrossRefGoogle Scholar
  40. Yin, Y., Wang, Y., Cheng, T. C. E., Liu, W., & Li, J. (2017). Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega, 69, 17–28.  https://doi.org/10.1016/j.omega.2016.07.006.CrossRefGoogle Scholar
  41. Yuan, X., Tian, H., Yuan, Y., Huang, Y., & Ikram, R. M. (2015). An extended NSGA-III for solution multi-objective hydro-thermal-wind scheduling considering wind power cost. Energy Conversion and Management, 96, 568–578.  https://doi.org/10.1016/j.enconman.2015.03.009.CrossRefGoogle Scholar
  42. Yuen, B. J. (1995). Improved heuristics for sequencing cutting patterns. European Journal of Operational Research, 87(1), 57–64.CrossRefGoogle Scholar
  43. Zhang, B., Pan, Q. K., Gao, L., Zhang, X. L., & Chen, Q. D. (2018). A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production. Computers & Industrial Engineering, 116, 22–36.CrossRefGoogle Scholar
  44. Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257–271.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.The State Key Laboratory of Digital Manufacturing Equipment and TechnologyHuazhong University of Science and TechnologyWuhanPeople’s Republic of China
  2. 2.Hubei Key Laboratory of Hydroelectric Machinery Design and MaintenanceChina Three Gorges UniversityYichangChina

Personalised recommendations