Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration
- 107 Downloads
This paper investigates a parallel-machine group scheduling problem where non-identical jobs with arbitrary sizes and inclusive processing set restrictions can be either processed on in-house parallel machines in the form of serial batch or outsourced with cost. The objective of our study is aimed at minimizing the weighted sum of the in-house makespan and the total outsourcing cost for a platform manufacturing enterprise. Some structural properties are identified for the optimal solution in some special cases of the studied problem, which contribute to the optimal solution for the studied problem. Further, based on these properties, a novel hybrid algorithm VNS–NKEA is proposed to solve the studied problem, which integrates neighborhood knowledge-based evolutionary algorithm (NKEA) and variable neighborhood search (VNS). To demonstrate the better performance including solution quality and the convergence speed of the proposed algorithm, computational experiments are conducted to evaluate its performance by comparing with other proposed algorithms. The experiment results show that the hybrid algorithm performs quite better than other compared algorithms for each instance, which reflect that the hybrid algorithm can solve the studied problem effectively.
KeywordsSerial-batching Group scheduling Step-deterioration Parallel machines Outsourcing Inclusive processing set restrictions Platform enterprise
This work is supported by the National Natural Science Foundation of China (Nos. 71871080, 71601065, 71501058, 71690235, 71231004), and Innovative Research Groups of the National Natural Science Foundation of China (71521001), the Humanities and Social Sciences Foundation of the Chinese Ministry of Education (No. 15YJC630097), and Base of Introducing Talents of Discipline to Universities for Optimization and Decision-making in the Manufacturing Process of Complex Product (111 Project). Panos M. Pardalos is partially supported by the Project of “Distinguished International Professor by the Chinese Ministry of Education” (MS2014HFGY026).
- 3.Dupont, L., Ghazvini, F.J.: Minimizing makespan on a single batch processing machine with non-identical job sizes. J. Eur. Syst. Autom. 32(4), 431–440 (1998)Google Scholar
- 26.Liao, B., Pei, J., Yang, S., Pardalos, P.M., Lu, S.: Single-machine and parallel-machine parallel batching scheduling considering deteriorating jobs, various group, and time-dependent setup time. Informatica 29(2), 281–301 (2018)Google Scholar
- 52.Ma, C., Kong, M., Pei, J., Pardalos, P.M.: BRKGA–VNS for parallel-batching scheduling on a single machine with step-deteriorating jobs and release times. In: International Workshop on Machine Learning, Optimization, and Big Data, pp. 414–425. Springer, Cham (2017)Google Scholar