Two parallel-machine scheduling with maximum waiting time for an emergency job

• Published in: International journal of production research Vol. 62; no. 16; pp. 6016 - 6027
• Main Authors: Jiang, Yiwei, Yuan, Haodong, Zhou, Ping, Cheng, T. C. E., Ji, Min
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 17.08.2024
• Subjects: approximation algorithm; emergency job; makespan; Parallel machines
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2023.2296024

In modern manufacturing and service industries, urgent orders and service tasks are common, and the speed of handling such urgent tasks is an important indicator of production and service efficiency. In this study, we consider scheduling jobs on two parallel machines with the random arrival of an emergency job. The objective is to minimise the makespan, subject to a given maximum waiting time of the emergency job. We first show that the worst-case ratio of the existing algorithm LPT $ _l $ l -SPT $ _{m-l} $ m − l is at least 3/2 when m = 2. We then analyse some properties of the optimal schedule and derive lower bounds on the optimal makespan. Finally, we present an improved approximation algorithm with a tight worst-case ratio of 4/3. We also provide numerical results showing that our proposed algorithm outperforms algorithm LPT $ _l $ l -SPT $ _{m-l} $ m − l .