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

Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties

Author

Listed:
  • Yu Tian

    (Department of Basic, Shenyang Sport University, Shenyang 110102, P. R. China)

Abstract

In this study, the due-window assignment single-machine scheduling problem with resource allocation is considered, where the processing time of a job is controllable as a linear or convex function of amount of resource allocated to the job. Under common due-window and slack due-window assignments, our goal is to determine the optimal sequence of all jobs, the due-window start time, due-window size, and optimal resource allocation such that a sum of the scheduling cost (including weighted earliness/tardiness penalty, weighted number of early and tardy job, weighted due-window start time, and due-window size) and resource consumption cost is minimized. We analyze the optimality properties, and provide polynomial time solutions to solve the problem under four versions of due-window assignment and resource allocation function.

Suggested Citation

  • Yu Tian, 2022. "Single-Machine Due-Window Assignment Scheduling with Resource Allocation and Generalized Earliness/Tardiness Penalties," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 39(05), pages 1-16, October.
    • Handle: RePEc:wsi:apjorx:v:39:y:2022:i:05:n:s021759592150041x
    DOI: 10.1142/S021759592150041X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759592150041X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759592150041X?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:39:y:2022:i:05:n:s021759592150041x. 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.