IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v18y2020i2d10.1007_s10288-019-00410-4.html
   My bibliography  Save this article

Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices

Author

Listed:
  • Rubing Chen

    (Zhengzhou University)

  • Jinjiang Yuan

    (Zhengzhou University)

Abstract

In this paper, we study the scheduling of proportional-linearly deteriorating jobs with positional due indices, release dates, deadlines and precedence relations on a single machine. The scheduling criteria studied in this paper include the makespan, maximum lateness, maximum tardiness, maximum flow time, maximum weighted completion time, maximum scheduling cost, total completion time, and the number of tardy jobs. By applying Lawler’s rule and Smith’s rule, polynomially solvable problems are processed by using two unified methods. We also present some new NP-hardness results when processing times of the jobs have no deterioration. Our results generalize a series of known achievements in the literature.

Suggested Citation

  • Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    • Handle: RePEc:spr:aqjoor:v:18:y:2020:i:2:d:10.1007_s10288-019-00410-4
    DOI: 10.1007/s10288-019-00410-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-019-00410-4
    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/s10288-019-00410-4?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. Gawiejnowicz, Stanislaw, 2007. "Scheduling deteriorating jobs subject to job or machine availability constraints," European Journal of Operational Research, Elsevier, vol. 180(1), pages 472-478, July.
    2. Stanisław Gawiejnowicz & Alexander Kononov, 2014. "Isomorphic scheduling problems," Annals of Operations Research, Springer, vol. 213(1), pages 131-145, February.
    3. Chen, Qianqian & Lin, Ling & Tan, Zhiyi & Yan, Yujie, 2017. "Coordination mechanisms for scheduling games with proportional deterioration," European Journal of Operational Research, Elsevier, vol. 263(2), pages 380-389.
    4. E. L. Lawler & J. M. Moore, 1969. "A Functional Equation and its Application to Resource Allocation and Sequencing Problems," Management Science, INFORMS, vol. 16(1), pages 77-84, September.
    5. Nadia Brauner & Gerd Finke & Yakov Shafransky, 2017. "Lawler’s minmax cost problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 31-46, July.
    6. Ma, Ran & Tao, Jiping & Yuan, Jinjiang, 2016. "Online scheduling with linear deteriorating jobs to minimize the total weighted completion time," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 570-583.
    7. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    8. Qiulan Zhao & Jinjiang Yuan, 2017. "Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-12, October.
    9. Vitaly A. Strusevich & Kabir Rustogi, 2017. "Scheduling with Rate-Modifying Activities," International Series in Operations Research & Management Science, in: Scheduling with Time-Changing Effects and Rate-Modifying Activities, chapter 0, pages 317-331, Springer.
    10. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    11. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    12. Jinjiang Yuan, 2017. "Unary NP-hardness of minimizing the number of tardy jobs with deadlines," Journal of Scheduling, Springer, vol. 20(2), pages 211-218, April.
    13. Qiulan Zhao & Lingfa Lu & Jinjiang Yuan, 2016. "Rescheduling with new orders and general maximum allowable time disruptions," 4OR, Springer, vol. 14(3), pages 261-280, September.
    14. Vitaly A. Strusevich & Kabir Rustogi, 2017. "Scheduling with Time-Changing Effects and Rate-Modifying Activities," International Series in Operations Research and Management Science, Springer, number 978-3-319-39574-6, January.
    15. Cheng, Yushao & Sun, Shijie, 2009. "Scheduling linear deteriorating jobs with rejection on a single machine," European Journal of Operational Research, Elsevier, vol. 194(1), pages 18-27, April.
    16. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wenjie Li & Jinjiang Yuan, 2021. "Single-machine online scheduling of jobs with non-delayed processing constraint," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 830-843, May.

    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. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    2. Wenhua Li & Libo Wang & Xing Chai & Hang Yuan, 2020. "Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families," Mathematics, MDPI, vol. 8(2), pages 1-12, February.
    3. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    4. Briskorn, Dirk & Davari, Morteza & Matuschke, Jannik, 2021. "Single-machine scheduling with an external resource," European Journal of Operational Research, Elsevier, vol. 293(2), pages 457-468.
    5. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    6. 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.
    7. Lushchakova, Irene N., 2000. "Minimizing functions of infeasibilities in a two-machine flow shop," European Journal of Operational Research, Elsevier, vol. 121(2), pages 380-393, March.
    8. Gur Mosheiov & Daniel Oron, 2020. "Scheduling problems with a weight-modifying-activity," Annals of Operations Research, Springer, vol. 295(2), pages 737-745, December.
    9. Shi-Sheng Li & Ren-Xia Chen & Qi Feng & Cheng-Wen Jiao, 2019. "Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 957-971, October.
    10. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    11. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, September.
    12. Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
    13. Chen, Rubing & Cheng, T.C.E. & Ng, C.T. & Wang, Jun-Qiang & Wei, Hongjun & Yuan, Jinjiang, 2024. "Rescheduling to trade off between global disruption of original jobs with flexibility and scheduling cost of new jobs," Omega, Elsevier, vol. 128(C).
    14. Zhongyi Jiang & Fangfang Chen & Xiandong Zhang, 2022. "Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 116-139, January.
    15. Alan J. Soper & Vitaly A. Strusevich, 2020. "Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects," Journal of Scheduling, Springer, vol. 23(6), pages 665-680, December.
    16. Stanisław Gawiejnowicz & Wiesław Kurc, 2020. "New results for an open time-dependent scheduling problem," Journal of Scheduling, Springer, vol. 23(6), pages 733-744, December.
    17. Fridman, Ilia & Pesch, Erwin & Shafransky, Yakov, 2020. "Minimizing maximum cost for a single machine under uncertainty of processing times," European Journal of Operational Research, Elsevier, vol. 286(2), pages 444-457.
    18. Zhang, Liqi & Lu, Lingfa & Yuan, Jinjiang, 2009. "Single machine scheduling with release dates and rejection," European Journal of Operational Research, Elsevier, vol. 198(3), pages 975-978, November.
    19. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    20. Liqi Zhang & Lingfa Lu, 2016. "Parallel-machine scheduling with release dates and rejection," 4OR, Springer, vol. 14(2), pages 165-172, June.

    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:aqjoor:v:18:y:2020:i:2:d:10.1007_s10288-019-00410-4. 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.