Zobraziť v EDS

Mixed batch scheduling with non-identical job sizes to minimize makespan: Mixed batch scheduling with non-identical job sizes...: G.-Q. Fan et al.

Uložené v:
Podrobná bibliografia
Názov: Mixed batch scheduling with non-identical job sizes to minimize makespan: Mixed batch scheduling with non-identical job sizes...: G.-Q. Fan et al.
Autori: Fan, Guo-Qiang1 (AUTHOR) gqfan@xidian.edu.cn, Wang, Jun-Qiang2,3 (AUTHOR) wangjq@nwpu.edu.cn, Liu, Zhixin4 (AUTHOR) zhixin@umich.edu
Zdroj: OR Spectrum. Mar2025, Vol. 47 Issue 1, p105-127. 23p.
Predmety: *BATCH processing, *PRODUCTION scheduling, *ALGORITHMS, *SCHEDULING, *MACHINERY
Abstrakt: This paper studies a mixed batch scheduling problem with non-identical job sizes to minimize the makespan. Multiple jobs can be processed simultaneously as a batch on a mixed batch machine as long as the total size of the jobs in the batch does not exceed the machine capacity. The processing time of a batch is the weighted sum of the maximum processing time and total processing time of the jobs in the batch. We show that the problem is strongly NP-hard even with a single machine, and analyze the worst-case performance ratio of the longest processing time first fit (LPTFF) algorithm. Furthermore, we present the longest processing time first fit greedy (LPTFFG) algorithm, and show that the worst-case performance ratio of algorithm LPTFFG is better than that of algorithm LPTFF. Computational experiments show that algorithm LPTFFG fits the case with a large number of machines, small job sizes, and small weight of the maximum processing time. [ABSTRACT FROM AUTHOR]
Copyright of OR Spectrum is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáza: Business Source Index
Popis
Abstrakt:This paper studies a mixed batch scheduling problem with non-identical job sizes to minimize the makespan. Multiple jobs can be processed simultaneously as a batch on a mixed batch machine as long as the total size of the jobs in the batch does not exceed the machine capacity. The processing time of a batch is the weighted sum of the maximum processing time and total processing time of the jobs in the batch. We show that the problem is strongly NP-hard even with a single machine, and analyze the worst-case performance ratio of the longest processing time first fit (LPTFF) algorithm. Furthermore, we present the longest processing time first fit greedy (LPTFFG) algorithm, and show that the worst-case performance ratio of algorithm LPTFFG is better than that of algorithm LPTFF. Computational experiments show that algorithm LPTFFG fits the case with a large number of machines, small job sizes, and small weight of the maximum processing time. [ABSTRACT FROM AUTHOR]
ISSN:01716468
DOI:10.1007/s00291-024-00770-2