IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v122y2024ics0305048323001226.html
   My bibliography  Save this article

Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine

Author

Listed:
  • Zhang, Hongbin
  • Yang, Yu
  • Wu, Feng

Abstract

We investigate a general single-batch-processing machine scheduling problem of minimizing the total costs of all jobs with general convex piecewise linear cost functions, where the processing time, due dates, and sizes of jobs are non-uniform. Since the studied problem is NP-hard and the objective is irregular, we adopt a practical 3-step method that starts from a specific job sequence, finds the optimal and near-optimal schedules of the given job sequence, and then iteratively improves the schedules. For the restricted problem where the job sequence is given, we propose a dynamic programming algorithm to obtain the optimal schedule. To further reduce the running time, we also devise a span-limit tree search (SLTS) approach to find the near-optimal schedule. We then design a local search method to improve the solutions solved by SLTS. Finally, we design a branch and bound algorithm with a lower bound method for small-sized instances. All proposed methods are based on our analysis of the mathematical properties of the scheduling problem, and extensive numerical experiments are conducted to demonstrate their effectiveness and efficiency.

Suggested Citation

  • Zhang, Hongbin & Yang, Yu & Wu, Feng, 2024. "Scheduling a set of jobs with convex piecewise linear cost functions on a single-batch-processing machine," Omega, Elsevier, vol. 122(C).
    • Handle: RePEc:eee:jomega:v:122:y:2024:i:c:s0305048323001226
    DOI: 10.1016/j.omega.2023.102958
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048323001226
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2023.102958?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:eee:jomega:v:122:y:2024:i:c:s0305048323001226. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.