Author
Listed:
- Juan Zou
(School of Mathematical Sciences, Qufu Normal University, Qufu 273165, P. R. China)
- Yu-Kang Sui
(School of Mathematical Sciences, Qufu Normal University, Qufu 273165, P. R. China)
- Jie Gao
(School of Mathematical Sciences, Qufu Normal University, Qufu 273165, P. R. China)
- Xian-Zhao Zhang
(College of Mathematics and Statistics, Linyi University, Linyi 276005, P. R. China)
Abstract
We consider parallel identical machines scheduling problems with deteriorating maintenance activities and the option of job rejection. Each machine has at most one deteriorating maintenance activity. The length of each maintenance activity increases linearly with its starting time. The location of the maintenance activity on each machine needs to be determined. The goal is to find the sequence of jobs to minimize scheduling cost; we further the model by allowing job rejection. A job is either accepted and processed on one of machines, or rejected. The goal is to determine the sequence of the accepted jobs to minimize scheduling cost of the accepted jobs plus total rejection penalty of the rejected jobs. When the scheduling cost is the makespan, we design a pseudo-polynomial time algorithm, a 2-approximation algorithm and a fully polynomial time approximation scheme. When the scheduling cost is the total completion time, we provide a polynomial time algorithm for the problem. When the scheduling costs are the total weighted completion time under the agreeable ratio assumption and the maximum lateness, we present pseudo-polynomial time algorithms to solve these problems, respectively.
Suggested Citation
Juan Zou & Yu-Kang Sui & Jie Gao & Xian-Zhao Zhang, 2023.
"Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection,"
Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 40(01), pages 1-23, February.
Handle:
RePEc:wsi:apjorx:v:40:y:2023:i:01:n:s0217595922400139
DOI: 10.1142/S0217595922400139
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:40:y:2023:i:01:n:s0217595922400139. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.