Scheduling problems with rejection and piece-rate maintenance to minimise the total weighted completion time
by Xianyu Yu; Zhenq Wang; Kai Huang; Dehua Xu; Xiuzhi Sang
International Journal of Automation and Control (IJAAC), Vol. 16, No. 1, 2022

Abstract: This paper addresses the single machine scheduling problems with simultaneous consideration of rejection and piece-rate maintenance. Each job is either accepted to be processed on the machine, or rejected in which case a rejection penalty will be incurred. The piece-rate maintenance refers that the machine performs maintenance activity every time it completes a given number of jobs. The objective is to minimise the sum of weighted completion times, rejection costs and maintenance costs. Our contribution is threefold. First, the general case of the considered problem is proved to be NP-hard, and an approximate algorithm is developed to solve the problem. Second, for the case with agreeable condition that jobs with smaller processing times are weighted more, a pseudo-polynomial algorithm is developed to establish that the problem is NP-hard only in the ordinary sense. This pseudo-polynomial algorithm is further converted into a fully polynomial time approximation scheme (FPTAS). In the third, two special cases, in which one with all equal weights and the other one with all equal processing times, are proved to be solved in polynomial time.

Online publication date: Fri, 03-Dec-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Automation and Control (IJAAC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com