IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i6p825-832.html
   My bibliography  Save this article

Scheduling dynamic hybrid flowshop with serial batching machines

Author

Listed:
  • H Xuan

    (Zhengzhou University, Zhengzhou, China)

  • B Li

    (Zhengzhou University, Zhengzhou, China)

Abstract

This paper considers a multi-stage dynamic hybrid flowshop in which some stage contains several identical batching machines and the other stages contain several identical discrete machines. Each discrete machine can process no more than one operation at a time, and each batching machine can process several jobs continuously in a batch. This problem has a strong practical background in the process industry. Since the problem is NP-hard, improved Lagrangian relaxation (LR) is developed where batch decomposition strategy is applied and mixed backward and forward dynamic programming is designed to solve batch-level subproblems with the case that each operation may have multiple predecessors and successors. Results of numerical experiments with up to 60 jobs show that the proposed algorithm can obtain better solutions in a reasonable computation time than traditional LR.

Suggested Citation

  • H Xuan & B Li, 2013. "Scheduling dynamic hybrid flowshop with serial batching machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(6), pages 825-832, June.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:6:p:825-832
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n6/pdf/jors201264a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n6/full/jors201264a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Juan Zou & Cuixia Miao, 2016. "The single machine serial batch scheduling problems with rejection," Operational Research, Springer, vol. 16(2), pages 211-221, July.

    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:pal:jorsoc:v:64:y:2013:i:6:p:825-832. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.