New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time-Reference-Cited by-同舟云学术

New Results on Single-Machine Scheduling with Rejection to Minimize the Total Weighted Completion Time

Published:2024-02-01 Issue:1 Volume:49 Page:75-94
ISSN:2300-3405
Container-title:Foundations of Computing and Decision Sciences
language:en
Short-container-title:

Author:

Zhang Liqi¹,Yu Xue²,Lu Lingfa²

Affiliation:

1. College of Information and Management Science , Henan Agricultural University , Zhengzhou, Henan province, P.R. China

2. School of Mathematics and Statistics , Zhengzhou University , Zhengzhou, Henan province, P.R. China

Abstract

Abstract In this paper, we study eight single-machine scheduling problems with rejection and position-dependent parameters. We consider two position-dependent parameters as follows: (1) position-dependent weights and (2) position-dependent processing times. In addition, we also introduce a weight-modifying activity or a rate-modifying activity into our problems. In the first six problems, the task is to minimize the sum of the total weighted completion time of accepted jobs and the total rejection cost of rejected jobs. We show that all six problems can be solved in polynomial time. In the last two problems, the task is to minimize the total weighted completion time of accepted jobs under the constraint that the total rejection cost of rejected jobs can not exceed a given upper bound. We show that these two problems are binary NP-hard and each problem admits an FPTAS.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/fcds-2024-0006

Reference24 articles.

1. A. Agnetis, G. Mosheiov, Scheduling with job rejection and position-dependent processing times on proportionate flowshops. Optimization Letters 11, 885-892, 2017.

2. A. Bachman, A. Janiak, Scheduling jobs with position-dependent processing times. Journal of the Operational Research Society 55, 257-264, 2004.

3. Y. Bartal, S. Leonardi, A.M. Spaccamela, J. Stougie, Multi-processor scheduling with rejection. SIAM Journal on Discrete Mathematics 13, 64-78, 2000.

4. Z.G. Cao, Z. Wang, Y.Z. Zhang, S.P. Liu, On several scheduling problems with rejection or discretely compressible processing times. Lecture Notes in Computer Science 3959, 90-98, 2006.

5. Y.R. Chen, Z.L. Guan, Y.C. Tsai, F.D. Chou, Single machine scheduling problem with a weight-modifying activity to minimize the total weighted completion time. IEEE Access 10, 45444-45456, 2022.