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

New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm

Author

Listed:
  • Jian-Ya Ding
  • Shiji Song
  • Jatinder N.D. Gupta
  • Cheng Wang
  • Rui Zhang
  • Cheng Wu

Abstract

This paper proposes new block properties for the flowshop scheduling problem with blocking to minimise makespan. A pruning procedure based on these proposed properties is used in the construction phase of an iterated greedy algorithm to decrease the total number of solutions to be examined to find an optimal schedule. Computational results using Taillard’s benchmark problem instances show that the new block properties help to eliminate more ‘unpromising’ solutions than the classic properties. In addition, the effectiveness of the proposed algorithm is verified by comparison with some high-performing algorithms for the considered problem.

Suggested Citation

  • Jian-Ya Ding & Shiji Song & Jatinder N.D. Gupta & Cheng Wang & Rui Zhang & Cheng Wu, 2016. "New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm," International Journal of Production Research, Taylor & Francis Journals, vol. 54(16), pages 4759-4772, August.
    • Handle: RePEc:taf:tprsxx:v:54:y:2016:i:16:p:4759-4772
    DOI: 10.1080/00207543.2015.1076941
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2015.1076941
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2015.1076941?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. Chen-Yang Cheng & Shih-Wei Lin & Pourya Pourhejazy & Kuo-Ching Ying & Yu-Zhe Lin, 2021. "No-Idle Flowshop Scheduling for Energy-Efficient Production: An Improved Optimization Framework," Mathematics, MDPI, vol. 9(12), pages 1-18, June.
    2. Foumani, Mehdi & Smith-Miles, Kate, 2019. "The impact of various carbon reduction policies on green flowshop scheduling," Applied Energy, Elsevier, vol. 249(C), pages 300-315.
    3. S. S. Panwalkar & Christos Koulamas, 2020. "Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines," Journal of Scheduling, Springer, vol. 23(1), pages 145-154, February.

    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:54:y:2016:i:16:p:4759-4772. 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.