IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v60y2013i1p46-55.html
   My bibliography  Save this article

Review of the ordered and proportionate flow shop scheduling research

Author

Listed:
  • S.S. Panwalkar
  • Milton L. Smith
  • Christos Koulamas

Abstract

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013

Suggested Citation

  • S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    • Handle: RePEc:wly:navres:v:60:y:2013:i:1:p:46-55
    DOI: 10.1002/nav.21518
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21518
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21518?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
    ---><---

    References listed on IDEAS

    as
    1. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
    2. Koulamas, Christos & Kyparisis, George J., 2007. "Single-machine and two-machine flowshop scheduling with general learning functions," European Journal of Operational Research, Elsevier, vol. 178(2), pages 402-407, April.
    3. Panwalkar, S.S. & Koulamas, Christos, 2012. "An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines," European Journal of Operational Research, Elsevier, vol. 221(1), pages 7-13.
    4. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1976. "Flowshop sequencing problem with ordered processing time matrices: A general case," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(3), pages 481-486, September.
    5. Nowicki, Eugeniusz & Zdrzalka, Stanislaw, 1988. "A two-machine flow shop scheduling problem with controllable job processing times," European Journal of Operational Research, Elsevier, vol. 34(2), pages 208-220, March.
    6. S. S. Panwalkar & A. W. Khan, 1977. "A convex property of an ordered flow shop sequencing problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 24(1), pages 159-162, March.
    7. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    8. Michael Pinedo, 1985. "A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine," Management Science, INFORMS, vol. 31(7), pages 840-846, July.
    9. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    10. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    11. Koulamas, Christos & Kyparisis, George J., 2009. "A note on the proportionate flow shop with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 193(2), pages 644-645, March.
    12. Widmer, Marino & Hertz, Alain, 1989. "A new heuristic method for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 41(2), pages 186-193, July.
    13. Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
    14. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    15. R. A. Dudek & S. S. Panwalkar & M. L. Smith, 1992. "The Lessons of Flowshop Scheduling Research," Operations Research, INFORMS, vol. 40(1), pages 7-13, February.
    16. Michael Pinedo, 1982. "Minimizing the Expected Makespan in Stochastic Flow Shops," Operations Research, INFORMS, vol. 30(1), pages 148-162, February.
    17. Sen, Alper & Topaloglu, Engin & Benli, Omer S., 1998. "Optimal streaming of a single job in a two-stage flow shop," European Journal of Operational Research, Elsevier, vol. 110(1), pages 42-62, October.
    18. Salah E. Elmaghraby, 1968. "The machine sequencing problem – review and extensions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 15(2), pages 205-232, June.
    19. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    20. Della Croce, Federico & Gupta, Jatinder N. D. & Tadei, Roberto, 2000. "Minimizing tardy jobs in a flowshop with common due date," European Journal of Operational Research, Elsevier, vol. 120(2), pages 375-381, January.
    21. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    22. Choi, Byung-Cheon & Chung, Jibok, 2011. "Two-machine flow shop scheduling problem with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(1), pages 66-72, August.
    23. Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2010. "Flow shops with machine maintenance: Ordered and proportionate cases," European Journal of Operational Research, Elsevier, vol. 207(1), pages 97-104, November.
    24. Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jin Qian & Haiyan Han, 2022. "Improved algorithms for proportionate flow shop scheduling with due-window assignment," Annals of Operations Research, Springer, vol. 309(1), pages 249-258, February.
    2. Shabtay, Dvir & Gilenson, Miri, 2023. "A state-of-the-art survey on multi-scenario scheduling," European Journal of Operational Research, Elsevier, vol. 310(1), pages 3-23.
    3. 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.
    4. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    5. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    6. Yu, Tae-Sun & Han, Jun-Hee, 2021. "Scheduling proportionate flow shops with preventive machine maintenance," International Journal of Production Economics, Elsevier, vol. 231(C).
    7. Xinyu Sun & Xin-Na Geng & Tao Liu, 2020. "Due-window assignment scheduling in the proportionate flow shop setting," Annals of Operations Research, Springer, vol. 292(1), pages 113-131, September.
    8. 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.
    9. Myoung-Ju Park & Byung-Cheon Choi & Yunhong Min & Kyung Min Kim, 2020. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-16, January.
    10. 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.
    11. Gur Mosheiov & Assaf Sarig & Vitaly Strusevich, 2020. "Minmax scheduling and due-window assignment with position-dependent processing times and job rejection," 4OR, Springer, vol. 18(4), pages 439-456, December.
    12. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2020. "Scheduling a proportionate flow shop of batching machines," Journal of Scheduling, Springer, vol. 23(5), pages 575-593, October.
    13. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.
    14. S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    2. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    3. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    4. 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.
    5. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    6. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    7. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    8. S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.
    9. Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2010. "Flow shops with machine maintenance: Ordered and proportionate cases," European Journal of Operational Research, Elsevier, vol. 207(1), pages 97-104, November.
    10. Choi, Byung-Cheon & Chung, Jibok, 2011. "Two-machine flow shop scheduling problem with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(1), pages 66-72, August.
    11. Della Croce, Federico & Koulamas, Christos & T'kindt, Vincent, 2017. "A constraint generation approach for two-machine shop problems with jobs selection," European Journal of Operational Research, Elsevier, vol. 259(3), pages 898-905.
    12. S.S. Panwalkar & Christos Koulamas, 2015. "Scheduling research and the first decade of NRLQ: A historical perspective," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(4), pages 335-344, June.
    13. Yu, Tae-Sun & Han, Jun-Hee, 2021. "Scheduling proportionate flow shops with preventive machine maintenance," International Journal of Production Economics, Elsevier, vol. 231(C).
    14. Rubén Ruiz & Ali Allahverdi, 2007. "Some effective heuristics for no-wait flowshops with setup times to minimize total completion time," Annals of Operations Research, Springer, vol. 156(1), pages 143-171, December.
    15. 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.
    16. Baker, Kenneth R. & Altheimer, Dominik, 2012. "Heuristic solution methods for the stochastic flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(1), pages 172-177.
    17. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    18. Panwalkar, S.S. & Koulamas, Christos, 2012. "An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines," European Journal of Operational Research, Elsevier, vol. 221(1), pages 7-13.
    19. Barry B. & Quim Castellà & Angel A. & Helena Ramalhinho Lourenco & Manuel Mateo, 2012. "ILS-ESP: An Efficient, Simple, and Parameter-Free Algorithm for Solving the Permutation Flow-Shop Problem," Working Papers 636, Barcelona School of Economics.
    20. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.

    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:wly:navres:v:60:y:2013:i:1:p:46-55. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.