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

Study on Due-Date Assignment Scheduling with Setup Times and General Truncated Learning Effects

Author

Listed:
  • Yifu Feng

    (Anqing Medical College, Anhui, Anqing, P. R. China)

  • Zonghai Hu

    (Anqing Medical College, Anhui, Anqing, P. R. China)

  • Rui Si

    (Anqing Medical College, Anhui, Anqing, P. R. China)

  • Ji-Bo Wang

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

Abstract

This paper concentrates on the single-machine scheduling problem with past-sequence-dependent setup times and general truncated learning effects, where the job processing times are non-increasing function of their positions in a sequence. Under common, slack and different (unrestricted) due-date assignments, our goal is to minimize the weighted sum of number of early/tardy jobs and due-date assignment cost, where the weight is not related to the job but to a position, i.e., the position-dependent weight. Under the three due-date assignments, some optimal properties and three optimal solution algorithms are proposed to solve these problems, respectively.

Suggested Citation

  • Yifu Feng & Zonghai Hu & Rui Si & Ji-Bo Wang, 2024. "Study on Due-Date Assignment Scheduling with Setup Times and General Truncated Learning Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(01), pages 1-16, February.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:01:n:s0217595923500069
    DOI: 10.1142/S0217595923500069
    as

    Download full text from publisher

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