Operations Research Transactions ›› 2019, Vol. 23 ›› Issue (4): 95-104.doi: 10.15960/j.cnki.issn.1007-6093.2019.04.008

Previous Articles     Next Articles

An improved algorithm for single-machine scheduling problem with a period of maintenance to minimize total delivery time

LI Ganggang1,*, LU Xiwen2   

  1. 1. School of Information Technology, Jiangxi University of Finance and Economics, Nanchang 330013, China;
    2. School of Science, East China University of Science and Technology, Shanghai 200237, China
  • Received:2017-09-11 Published:2019-12-04

Abstract: The single-machine scheduling problem with a period of maintenance to minimize total delivery time has been studied. In this paper, we revisit the problem and propose an algorithm with time complexity of O(n3) to improve the worst-case ratio from 3/2 to 5/4.

Key words: scheduling, delivery time, maintenance, algorithm, worst-case ratio

CLC Number: