Back to Search
Start Over
Mixed batch scheduling on identical machines.
- Source :
- Journal of Scheduling; Aug2020, Vol. 23 Issue 4, p487-496, 10p
- Publication Year :
- 2020
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- BATCH processing
POLYNOMIAL time algorithms
ALGORITHMS
HEAT treatment
Subjects
Details
- Language :
- English
- ISSN :
- 10946136
- Volume :
- 23
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Journal of Scheduling
- Publication Type :
- Academic Journal
- Accession number :
- 144474017
- Full Text :
- https://doi.org/10.1007/s10951-019-00623-9