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

Research on Multiple Slack Due-Date Assignments Scheduling with Position-Dependent Weights

Author

Listed:
  • Ji-Bo Wang

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

  • Han Bao

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

  • Congying Wan

    (Institute for Northeast Full Revitalization, Dongbei University of Finance and Economics, Dalian, Liaoning 116025, P. R. China)

Abstract

This paper considers a single-machine scheduling problem where jobs have multiple slack due-date assignments, i.e., some jobs have a common flow allowance and all jobs have m (m > 0 is a given constant) common flow allowances. The objective is to determine the multiple common flow allowances and optimal job sequence that minimizes the weighted sum of earliness-tardiness penalty and slack due-date assignment cost, where the weights only depend on their positions in a sequence, i.e., the position-dependent weights. Optimal properties are given for this problem, and then the problem is shown to be polynomially solvable when the number of multiple slack due-date assignments is a given constant. The model with multiple slack due-date assignments can also be extended to position (time)-dependent scheduling.

Suggested Citation

  • Ji-Bo Wang & Han Bao & Congying Wan, 2024. "Research on Multiple Slack Due-Date Assignments Scheduling with Position-Dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(05), pages 1-16, October.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:05:n:s0217595923500392
    DOI: 10.1142/S0217595923500392
    as

    Download full text from publisher

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