Zobraziť v EDS

Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process.

Uložené v:
Podrobná bibliografia
Názov: Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process.
Autori: Ma, Ran1 (AUTHOR) sungirlmr@126.com, Meng, Lanmeng1 (AUTHOR), Zhang, Yuzhong2 (AUTHOR)
Zdroj: Journal of the Operational Research Society. Mar2025, Vol. 76 Issue 3, p454-465. 12p.
Predmety: *BATCH processing, *SCHEDULING, *CONSUMERS, ONLINE algorithms, ROLLING (Metalwork)
Abstrakt: As market competition intensifies, modern enterprises prioritize customer demands, leading to an increased emphasis on multi-variety and small-batch production. In this article, we study the online scheduling problem for incompatible batch processing with the deterioration effect to minimize the maximum delivery completion time in the billet rolling process, where the batch capacity and delivery capacity are unbounded. We assume that the processing time of job Jj is expressed as p j = a j (A + Bt) , where A > 0, B > 0, t denotes the start time of job and aj > 0 represents the job's processing deterioration rate. For such an online problem, we first prove that the lower bound of the problem is (1 + B a max) k , where k denotes the number of job families and a max represents the maximum deterioration ratio in job instance. Then we design an online algorithm Largest Delivery Time With Batch Processing and demonstrate that the competitive ratio of the algorithm is no more than 1 + (1 + B a max) k. Finally, experiments on randomly generated instances prove that our algorithm is reasonable and effective. [ABSTRACT FROM AUTHOR]
Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd 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:As market competition intensifies, modern enterprises prioritize customer demands, leading to an increased emphasis on multi-variety and small-batch production. In this article, we study the online scheduling problem for incompatible batch processing with the deterioration effect to minimize the maximum delivery completion time in the billet rolling process, where the batch capacity and delivery capacity are unbounded. We assume that the processing time of job Jj is expressed as p j = a j (A + Bt) , where A > 0, B > 0, t denotes the start time of job and aj > 0 represents the job's processing deterioration rate. For such an online problem, we first prove that the lower bound of the problem is (1 + B a max) k , where k denotes the number of job families and a max represents the maximum deterioration ratio in job instance. Then we design an online algorithm Largest Delivery Time With Batch Processing and demonstrate that the competitive ratio of the algorithm is no more than 1 + (1 + B a max) k. Finally, experiments on randomly generated instances prove that our algorithm is reasonable and effective. [ABSTRACT FROM AUTHOR]
ISSN:01605682
DOI:10.1080/01605682.2024.2366537