IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i03ns0217595923500264.html
   My bibliography  Save this article

Controllable Processing Time Scheduling with Total Weighted Completion Time Objective and Deteriorating Jobs

Author

Listed:
  • Ji-Bo Wang

    (School of Science, Shenyang Aerospace University, Shenyang, Liaoning 110136, P. R. China)

  • Yi-Chun Wang

    (School of Science, Shenyang Aerospace University, Shenyang, Liaoning 110136, P. R. China)

  • Congying Wan

    (Institute of Economic and Social Development, Dongbei University of Finance and Economics, Dalian, Liaoning 116025, P. R. China)

  • Dan-Yang Lv

    (School of Science, Shenyang Aerospace University, Shenyang, Liaoning 110136, P. R. China)

  • Lei Zhang

    (School of Science, Shenyang Aerospace University, Shenyang, Liaoning 110136, P. R. China)

Abstract

In this paper, we consider two single-machine scheduling problems with deteriorating jobs and controllable processing time. The job processing time is a function of its starting time and resource allocation. For the convex resource function, a bicriteria analysis is provided, where the first (respectively, second) criteria is to minimize total weighted completion time (respectively, total resource consumption cost). The first problem is to minimize the weighted sum of the total weighted completion time and the total resource consumption cost. The second problem is to minimize the total weighted completion time subject to the total resource consumption cost is bound. These both problems are NP-hard, we propose some heuristic algorithms and a branch-and-bound algorithm to solve the problems.

Suggested Citation

  • Ji-Bo Wang & Yi-Chun Wang & Congying Wan & Dan-Yang Lv & Lei Zhang, 2024. "Controllable Processing Time Scheduling with Total Weighted Completion Time Objective and Deteriorating Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(03), pages 1-24, June.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:03:n:s0217595923500264
    DOI: 10.1142/S0217595923500264
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595923500264
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595923500264?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.

    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:41:y:2024:i:03:n:s0217595923500264. 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.

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