IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i2p560-566.html
   My bibliography  Save this article

Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion

Author

Listed:
  • Sergey Kovalev
  • Mikhail Y. Kovalyov
  • Gur Mosheiov
  • Enrique Gerstl

Abstract

The problem of minimising total absolute deviation of job completion times in a two-machine no-wait proportionate flow shop has been recently studied. It was shown that the LPT (largest processing time first) job sequence is optimal if the number of jobs n does not exceed 7, and that the LPT sequence is not optimal for instances with n≥8 $ n \ge 8 $ . We prove that there exists an optimal semi-V-shaped job sequence, in which the first job has the largest processing time, a certain number, greater than n / 2, of the following jobs appear in the LPT order, and jobs following job with the minimum processing time are sequenced in the SPT (shortest processing time first) order. We also present an O(n3) $ O(n^3) $ time dynamic programming algorithm to find the best V-shaped job sequence, in which the jobs on the left of the job with the minimum processing time are sequenced in the LPT order and those on the right of this job are sequenced in the SPT order.

Suggested Citation

  • Sergey Kovalev & Mikhail Y. Kovalyov & Gur Mosheiov & Enrique Gerstl, 2019. "Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion," International Journal of Production Research, Taylor & Francis Journals, vol. 57(2), pages 560-566, January.
    • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:2:p:560-566
    DOI: 10.1080/00207543.2018.1468097
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1468097
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2018.1468097?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. Abdennour Azerine & Mourad Boudhar & Djamal Rebaine, 2022. "A two-machine no-wait flow shop problem with two competing agents," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 168-199, January.
    2. Koulamas, Christos & Kyparisis, George J., 2023. "Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection," European Journal of Operational Research, Elsevier, vol. 305(2), pages 608-616.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:57:y:2019:i:2:p:560-566. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.