IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v55y2024i4d10.1007_s13226-023-00454-7.html
   My bibliography  Save this article

Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria

Author

Listed:
  • Xin-gong Zhang

    (Chongqing Normal University)

  • Lu Li

    (Chongqing Normal University)

  • Pay-Wen Yu

    (Fu Jen Catholic University)

  • Chin-Chia Wu

    (Fengchia University)

Abstract

In this study we address some two-agent scheduling models with proportionally-linear deteriorated jobs, which the job processing time is assumed as an non-decreasing linear function of its starting time. Our goal is to find a job sequence in which the objective functions of agent A are minimized, satisfied that the objective functions of agent B cannot exceed a given bound such as the maximum cost, the total completion time, the number of the late jobs and total tardiness cost. We provide the optimal properties and propose pseud-polynomial-time or/and the polynomial-time algorithms to solve the problems under study.

Suggested Citation

  • Xin-gong Zhang & Lu Li & Pay-Wen Yu & Chin-Chia Wu, 2024. "Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria," Indian Journal of Pure and Applied Mathematics, Springer, vol. 55(4), pages 1499-1510, December.
    • Handle: RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00454-7
    DOI: 10.1007/s13226-023-00454-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-023-00454-7
    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/s13226-023-00454-7?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. Ren-Xia Chen & Shi-Sheng Li, 2019. "Two-agent single-machine scheduling with cumulative deterioration," 4OR, Springer, vol. 17(2), pages 201-219, June.
    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. Ruyan He & Jinjiang Yuan, 2020. "Two-Agent Preemptive Pareto-Scheduling to Minimize Late Work and Other Criteria," Mathematics, MDPI, vol. 8(9), pages 1-18, September.

    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:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00454-7. 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.