Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
394027 | Information Sciences | 2013 | 14 Pages |
Abstract
This paper considers the single machine scheduling problem with an operator non-availability period. The operator non-availability period is an open time interval in which a job may neither start nor complete. The objective is to minimize the total completion time. We prove that the problem is NP-hard, even if the length of the operator non-availability period is smaller than the processing time of any job. We also present an algorithm with a tight worst-case ratio of 20/1720/17.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Yong Chen, An Zhang, Zhiyi Tan,