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

Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights

Author

Listed:
  • Wei-Wei Liu

    (Department of Basic, Shenyang Sport University, Shenyang 110102, P. R. China2School of Computer Science and Engineering, Northeastern University, Shenyang 110169, P. R. China)

  • Chong Jiang

    (Department of Sport Education and Humanity, Nanjing Sport Institute, Nanjing 210014, P. R. China)

Abstract

In this paper, the flow shop resource allocation scheduling with learning effect and position-dependent weights on two-machine no-wait setting is considered. Under common due date assignment and slack due date assignment rules, a bi-criteria analysis is provided. The optimality properties and polynomial time algorithms are developed to solve four versions of the problem. For a special case of the problem, it is proved that the problem can be optimally solved by a lower order algorithm.

Suggested Citation

  • Wei-Wei Liu & Chong Jiang, 2020. "Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(03), pages 1-27, April.
    • Handle: RePEc:wsi:apjorx:v:37:y:2020:i:03:n:s0217595920500141
    DOI: 10.1142/S0217595920500141
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Baruch Mor, 2022. "Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 79-97, January.
    2. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    3. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.

    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:37:y:2020:i:03:n:s0217595920500141. 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.