Mixed batch scheduling on identical machines
- 99 Downloads
This paper studies a new mixed batch scheduling problem that arises in vacuum heat treatment. A mixed batch machine can process at most a given number of jobs simultaneously. The processing time of a batch is the weighted sum of the maximum processing time and the total processing time of jobs in the batch. The objective is to minimize the makespan. We first prove that the problem on a single machine can be solved in polynomial time, while the problem on multiple identical machines is NP-hard. Then, we develop a pseudopolynomial time exact algorithm when the number of machines is fixed. Further, we analyze the worst-case performance ratio of a full batch longest processing time algorithm and design Algorithm LPT-Greedy with improved worst-case performance.
KeywordsScheduling Batch Algorithm Complexity Worst-case performance ratio
We thank the Associate Editor and the two anonymous reviewers for their valuable comments and constructive suggestions, which helped us significantly improve the quality of our work. The work of the first two authors was partly supported by the National Natural Science Foundation of China (Grant Nos. 51675442 and 71931007) and the Innovation Foundation for Doctor Dissertation of Northwestern Polytechnical University, China (Grant No. CX201808).
- Cheng, T. C. E., & Kovalyov, M. Y. (2001). Single machine batch scheduling with sequential job processing. IIE Transactions, 33(5), 413–420.Google Scholar
- Liu, L., Wang, J., & Zhang, F. (2009). Scheduling jobs on parallel batch processing machines. In ISECS International colloquium on computing, communication, control, and management. CCCM 2009 (Vol. 1, pp. 78–81). IEEE.Google Scholar