IDEAS home Printed from https://ideas.repec.org/b/spr/isorms/978-1-4614-5152-5.html
   My bibliography  Save this book

Flow Shop Scheduling

Author

Listed:
  • Hamilton Emmons

    (Case Western Reserve University)

  • George Vairaktarakis

    (Case Western Reserve University)

Abstract

No abstract is available for this item.

Individual chapters are listed in the "Chapters" tab

Suggested Citation

  • Hamilton Emmons & George Vairaktarakis, 2013. "Flow Shop Scheduling," International Series in Operations Research and Management Science, Springer, edition 127, number 978-1-4614-5152-5, December.
    • Handle: RePEc:spr:isorms:978-1-4614-5152-5
    DOI: 10.1007/978-1-4614-5152-5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Wieslaw Kubiak & Yanling Feng & Guo Li & Suresh P. Sethi & Chelliah Sriskandarajah, 2020. "Efficient algorithms for flexible job shop scheduling with parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(4), pages 272-288, June.
    2. Rowan Wang & Oualid Jouini & Saif Benjaafar, 2014. "Service Systems with Finite and Heterogeneous Customer Arrivals," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 365-380, July.
    3. Bailin Wang & Kai Huang & Tieke Li, 2018. "Two-stage hybrid flowshop scheduling with simultaneous processing machines," Journal of Scheduling, Springer, vol. 21(4), pages 387-411, August.
    4. Yi Tan & Lars Mönch & John W. Fowler, 2018. "A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines," Journal of Scheduling, Springer, vol. 21(2), pages 209-226, April.
    5. Vahid Nasrollahi & Ghasem Moslehi & Mohammad Reisi-Nafchi, 2022. "Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem," Operational Research, Springer, vol. 22(2), pages 1403-1442, April.
    6. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    7. Robert Cuckler & Kuo-Hao Chang & Liam Y. Hsieh, 2017. "Optimal Parallel Machine Allocation Problem in IC Packaging Using IC-PSO: An Empirical Study," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(06), pages 1-20, December.
    8. Alexander Kononov & Julia Memar & Yakov Zinder, 2022. "On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements," Journal of Global Optimization, Springer, vol. 83(3), pages 445-456, July.
    9. Yakov Zinder & Alexandr Kononov & Joey Fung, 2021. "A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 276-309, August.
    10. Mohamed Amine Mkadem & Aziz Moukrim & Mehdi Serairi, 2021. "Exact method for the two-machine flow-shop problem with time delays," Annals of Operations Research, Springer, vol. 298(1), pages 375-406, March.

    Book Chapters

    The following chapters of this book are listed in IDEAS

    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:spr:isorms:978-1-4614-5152-5. 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.springer.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.