IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v48y2024i2d10.1007_s10878-024-01203-0.html
   My bibliography  Save this article

The prize-collecting single machine scheduling with bounds and penalties

Author

Listed:
  • Guojun Hu

    (Yunnan Normal University
    Yunnan University)

  • Pengxiang Pan

    (Yunnan University)

  • Suding Liu

    (Yunnan University
    University of Waterloo)

  • Ping Yang

    (Yunnan University)

  • Runtao Xie

    (Yunnan University)

Abstract

This study investigates the prize-collecting single machine scheduling with bounds and penalties (PC-SMS-BP). In this problem, a set of n jobs and a single machine are considered, where each job $$J_j$$ J j has a processing time $$p_{j}$$ p j , a profit $$\pi _{j}$$ π j and a rejection penalty $$w_{j}$$ w j . The upper bound on the processing number is U. The objective of this study is to find a feasible schedule that minimizes the makespan of the accepted jobs and the total rejection penalty of the rejected jobs under the condition that the number of the accepted jobs does not exceed a given threshold U while the total profit of the accepted jobs does not fall below a specified profit bound $$\varPi $$ Π . We first demonstrate that this problem is NP-hard. Then, a pseudo-polynomial time dynamic programming algorithm and a fully polynomial time approximation scheme (FPTAS) are proposed. Finally, numerical experiments are conducted to compare the effectiveness of the two proposed algorithms.

Suggested Citation

  • Guojun Hu & Pengxiang Pan & Suding Liu & Ping Yang & Runtao Xie, 2024. "The prize-collecting single machine scheduling with bounds and penalties," Journal of Combinatorial Optimization, Springer, vol. 48(2), pages 1-13, September.
    • Handle: RePEc:spr:jcomop:v:48:y:2024:i:2:d:10.1007_s10878-024-01203-0
    DOI: 10.1007/s10878-024-01203-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01203-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01203-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kellerer, Hans & Strusevich, Vitaly, 2013. "Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product," European Journal of Operational Research, Elsevier, vol. 228(1), pages 24-32.
    2. Xiaofei Liu & Man Xiao & Weidong Li & Yaoyu Zhu & Lei Ma, 2023. "Algorithms for single machine scheduling problem with release dates and submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    3. Baruch Mor & Dana Shapira, 2020. "Scheduling with regular performance measures and optional job rejection on a single machine," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(8), pages 1315-1325, August.
    4. Enrique Gerstl & Gur Mosheiov, 2017. "Single machine scheduling problems with generalised due-dates and job-rejection," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3164-3172, June.
    5. Hongye Zheng & Suogang Gao & Wen Liu & Weili Wu & Ding-Zhu Du & Bo Hou, 2022. "Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 343-353, August.
    6. Lu, Lingfa & Ng, C.T. & Zhang, Liqi, 2011. "Optimal algorithms for single-machine scheduling with rejection to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 130(2), pages 153-158, April.
    7. Abedinnia, Hamid & Glock, C. H. & Schneider, M. & Grosse, E. H., 2017. "Machine scheduling problems in production: A tertiary study," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 88118, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    8. Klaus Jansen & Kim-Manuel Klein & José Verschae, 2020. "Closing the Gap for Makespan Scheduling via Sparsification Techniques," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1371-1392, November.
    9. Weidong Li & Qianna Cui, 2018. "Vector scheduling with rejection on a single machine," 4OR, Springer, vol. 16(1), pages 95-104, March.
    10. Cheng He & Joseph Y.-T. Leung & Kangbok Lee & Michael L. Pinedo, 2016. "Improved algorithms for single machine scheduling with release dates and rejections," 4OR, Springer, vol. 14(1), pages 41-55, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiaofei Liu & Man Xiao & Weidong Li & Yaoyu Zhu & Lei Ma, 2023. "Algorithms for single machine scheduling problem with release dates and submodular penalties," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-18, May.
    2. Xiaofei Liu & Weidong Li & Yaoyu Zhu, 2021. "Single Machine Vector Scheduling with General Penalties," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    3. Matan Atsmony & Gur Mosheiov, 2023. "Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection," Journal of Scheduling, Springer, vol. 26(2), pages 193-207, April.
    4. Peihai Liu & Xiwen Lu, 2020. "New approximation algorithms for machine scheduling with rejection on single and parallel machine," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 929-952, November.
    5. Baruch Mor & Gur Mosheiov, 2021. "A note: flowshop scheduling with linear deterioration and job-rejection," 4OR, Springer, vol. 19(1), pages 103-111, March.
    6. Xiaofei Liu & Weidong Li, 2020. "Approximation Algorithm for the Single Machine Scheduling Problem with Release Dates and Submodular Rejection Penalty," Mathematics, MDPI, vol. 8(1), pages 1-11, January.
    7. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    8. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    9. Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
    10. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    11. S. Maryam Masoumi & Nima Kazemi & Salwa Hanim Abdul-Rashid, 2019. "Sustainable Supply Chain Management in the Automotive Industry: A Process-Oriented Review," Sustainability, MDPI, vol. 11(14), pages 1-30, July.
    12. Zhong, Xueling & Ou, Jinwen & Wang, Guoqing, 2014. "Order acceptance and scheduling with machine availability constraints," European Journal of Operational Research, Elsevier, vol. 232(3), pages 435-441.
    13. Ma, Ran & Guo, Sainan & Miao, Cuixia, 2021. "A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    14. Marcelo Werneck Barbosa, 2022. "A Critical Appraisal of Review Studies in Circular Economy: a Tertiary Study," Circular Economy and Sustainability, Springer, vol. 2(2), pages 473-505, June.
    15. Baruch Mor & Gur Mosheiov & Dana Shapira, 2021. "Single machine lot scheduling with optional job-rejection," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 1-11, January.
    16. Hao Guo & Weidong Li & Bin Deng, 2023. "A Survey on Fair Allocation of Chores," Mathematics, MDPI, vol. 11(16), pages 1-28, August.
    17. Imed Kacem & Hans Kellerer, 2024. "Minimizing the maximum lateness for scheduling with release times and job rejection," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-22, October.
    18. Oron, Daniel, 2021. "Two-agent scheduling problems under rejection budget constraints," Omega, Elsevier, vol. 102(C).
    19. Liqi Zhang & Lingfa Lu, 2016. "Parallel-machine scheduling with release dates and rejection," 4OR, Springer, vol. 14(2), pages 165-172, June.
    20. Baruch Mor & Gur Mosheiov, 2018. "A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection," Annals of Operations Research, Springer, vol. 271(2), pages 1079-1085, December.

    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:spr:jcomop:v:48:y:2024:i:2:d:10.1007_s10878-024-01203-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.