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

Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects

Author

Listed:
  • Dan-Yang Lv

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

  • Ji-Bo Wang

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

Abstract

In this paper, different due-window assignment flow shop scheduling problem with learning effect and resource allocation is considered. Under two machine no-wait flow shop setting, the goal is to determine the due-window starting time, due-window size, optimal resource allocation and the optimal sequence of all jobs. A bicriteria analysis of the problem is provided where the first criterion is to minimize the scheduling cost (including earliness-tardiness penalty, due-window starting time and due-window size of all jobs) and the second criterion is to minimize the resource consumption cost. It is shown that four versions about scheduling cost and resource consumption cost can be solved in polynomial time.

Suggested Citation

  • Dan-Yang Lv & Ji-Bo Wang, 2021. "Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(06), pages 1-23, December.
    • Handle: RePEc:wsi:apjorx:v:38:y:2021:i:06:n:s0217595921500081
    DOI: 10.1142/S0217595921500081
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595921500081
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595921500081?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:38:y:2021:i:06:n:s0217595921500081. 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.