IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v169y2006i3p816-854.html
   My bibliography  Save this article

A review of TSP based approaches for flowshop scheduling

Author

Listed:
  • Bagchi, Tapan P.
  • Gupta, Jatinder N.D.
  • Sriskandarajah, Chelliah

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:169:y:2006:i:3:p:816-854
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00147-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.
    2. Chelliah Sriskandarajah & Inna Drobouchevitch & Suresh P. Sethi & Ramaswamy Chandrasekaran, 2004. "Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot," Operations Research, INFORMS, vol. 52(1), pages 65-82, February.
    3. Kamoun, H. & Sriskandarajah, C., 1993. "The complexity of scheduling jobs in repetitive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 70(3), pages 350-364, November.
    4. Giorgio Carpaneto & Paolo Toth, 1980. "Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem," Management Science, INFORMS, vol. 26(7), pages 736-743, July.
    5. Willard I. Zangwill, 1987. "From EOQ Towards ZI," Management Science, INFORMS, vol. 33(10), pages 1209-1223, October.
    6. S. Thomas McCormick & Michael L. Pinedo & Scott Shenker & Barry Wolf, 1989. "Sequencing in an Assembly Line with Blocking to Minimize Cycle Time," Operations Research, INFORMS, vol. 37(6), pages 925-935, December.
    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. Jatinder Gupta & Christos Koulamas & George Kyparisis & Chris Potts & Vitaly Strusevich, 2004. "Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan," Annals of Operations Research, Springer, vol. 129(1), pages 171-185, July.
    9. 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.
    10. Nicholas G. Hall & Hichem Kamoun & Chelliah Sriskandarajah, 1997. "Scheduling in Robotic Cells: Classification, Two and Three Machine Cells," Operations Research, INFORMS, vol. 45(3), pages 421-439, June.
    11. Turner, Scott & Booth, Dean, 1987. "Comparison of heuristics for flow shop sequencing," Omega, Elsevier, vol. 15(1), pages 75-78.
    12. Simons, JV, 1992. "Heuristics in flow shop scheduling with sequence dependent setup times," Omega, Elsevier, vol. 20(2), pages 215-225, March.
    13. 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.
    14. Charles E. Noon & James C. Bean, 1991. "A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 39(4), pages 623-632, August.
    15. Ronconi, Debora P., 2004. "A note on constructive heuristics for the flowshop problem with blocking," International Journal of Production Economics, Elsevier, vol. 87(1), pages 39-48, January.
    16. Chelliah Sriskandarajah & Nicholas Hall & Hichem Kamoun, 1998. "Scheduling large robotic cells without buffers," Annals of Operations Research, Springer, vol. 76(0), pages 287-321, January.
    17. D. A. Wismer, 1972. "Solution of the Flowshop-Scheduling Problem with No Intermediate Queues," Operations Research, INFORMS, vol. 20(3), pages 689-697, June.
    18. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1992. "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 40(6), pages 1086-1094, December.
    19. Osman, IH & Potts, CN, 1989. "Simulated annealing for permutation flow-shop scheduling," Omega, Elsevier, vol. 17(6), pages 551-557.
    20. Robert J. Wittrock, 1988. "An Adaptable Scheduling Algorithm for Flexible Flow Lines," Operations Research, INFORMS, vol. 36(3), pages 445-453, June.
    21. Saadani, Nour El Houda & Guinet, Alain & Moalla, Mohamed, 2005. "A travelling salesman approach to solve the F/no-idle/Cmax problem," European Journal of Operational Research, Elsevier, vol. 161(1), pages 11-20, February.
    22. Y. Crama & V. Kats & J. van de Klundert & E. Levner, 2000. "Cyclic scheduling in robotic flowshops," Annals of Operations Research, Springer, vol. 96(1), pages 97-124, November.
    23. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    24. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
    25. Gupta, Jatinder N. D. & Darrow, William P., 1986. "The two-machine sequence dependent flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 24(3), pages 439-446, March.
    26. 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.
    27. Alessandro Agnetis, 1997. "No-wait flow shop scheduling with large lot sizes," Annals of Operations Research, Springer, vol. 70(0), pages 415-438, April.
    28. Potts, C. N., 1980. "An adaptive branching rule for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 5(1), pages 19-25, July.
    29. Richard Conway & William Maxwell & John O. McClain & L. Joseph Thomas, 1988. "The Role of Work-in-Process Inventory in Serial Production Lines," Operations Research, INFORMS, vol. 36(2), pages 229-241, April.
    30. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    31. Sujit K. Dutta & Andrew A. Cunningham, 1975. "Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage," Management Science, INFORMS, vol. 21(9), pages 989-996, May.
    32. Dan Trietsch & Kenneth R. Baker, 1993. "Basic Techniques for Lot Streaming," Operations Research, INFORMS, vol. 41(6), pages 1065-1076, December.
    33. Rios-Mercado, Roger Z. & Bard, Jonathan F., 1998. "Heuristics for the flow line problem with setup costs," European Journal of Operational Research, Elsevier, vol. 110(1), pages 76-98, October.
    34. Agnetis, A., 2000. "Scheduling no-wait robotic cells with two and three machines," European Journal of Operational Research, Elsevier, vol. 123(2), pages 303-314, June.
    35. Logendran, Rasaratnam & Sriskandarajah, Chelliah, 1993. "Two-machine group scheduling problem with blocking and anticipatory setups," European Journal of Operational Research, Elsevier, vol. 69(3), pages 467-481, September.
    36. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    37. Sriskandarajah, C., 1993. "Performance of scheduling algorithms for no-wait flowshops with parallel machines," European Journal of Operational Research, Elsevier, vol. 70(3), pages 365-378, November.
    38. 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.
    39. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    40. D P Ronconi & V A Armentano, 2001. "Lower bounding schemes for flowshops with blocking in-process," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(11), pages 1289-1297, November.
    41. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.
    42. Sriskandarajah, C. & Sethi, S. P., 1989. "Scheduling algorithms for flexible flowshops: Worst and average case performance," European Journal of Operational Research, Elsevier, vol. 43(2), pages 143-160, November.
    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. Annear, Luis Mauricio & Akhavan-Tabatabaei, Raha & Schmid, Verena, 2023. "Dynamic assignment of a multi-skilled workforce in job shops: An approximate dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1109-1125.
    2. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    3. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    4. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    5. Kim, Taebok & Glock, Christoph H., 2018. "Production planning for a two-stage production system with multiple parallel machines and variable production rates," International Journal of Production Economics, Elsevier, vol. 196(C), pages 284-292.
    6. Romero-Silva, Rodrigo & Hernández-López, Gabriel, 2020. "Shop-floor scheduling as a competitive advantage: A study on the relevance of cyber-physical systems in different manufacturing contexts," International Journal of Production Economics, Elsevier, vol. 224(C).
    7. 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.
    8. Vahid Riahi & Morteza Kazemi, 2018. "A new hybrid ant colony algorithm for scheduling of no-wait flowshop," Operational Research, Springer, vol. 18(1), pages 55-74, April.
    9. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    10. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    11. He, Xuan & Pan, Quan-Ke & Gao, Liang & Neufeld, Janis S., 2023. "An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 597-610.
    12. Konrad Stephan & Nils Boysen, 2017. "Crane scheduling in railway yards: an analysis of computational complexity," Journal of Scheduling, Springer, vol. 20(5), pages 507-526, October.
    13. Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2012. "The x-and-y-axes travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 333-345.

    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. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    2. Liu, Shi Qiang & Kozan, Erhan, 2009. "Scheduling a flow shop with combined buffer conditions," International Journal of Production Economics, Elsevier, vol. 117(2), pages 371-380, February.
    3. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    4. Ruiz, Ruben & Maroto, Concepcion & Alcaraz, Javier, 2005. "Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics," European Journal of Operational Research, Elsevier, vol. 165(1), pages 34-54, August.
    5. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    6. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    7. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    8. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    9. Kalczynski, Pawel Jan & Kamburowski, Jerzy, 2007. "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, Elsevier, vol. 35(1), pages 53-60, February.
    10. 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.
    11. 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.
    12. Drobouchevitch, Inna G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 2006. "Scheduling dual gripper robotic cell: One-unit cycles," European Journal of Operational Research, Elsevier, vol. 171(2), pages 598-631, June.
    13. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    14. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    15. Milind Dawande & Michael Pinedo & Chelliah Sriskandarajah, 2009. "Multiple Part-Type Production in Robotic Cells: Equivalence of Two Real-World Models," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 210-228, February.
    16. 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.
    17. Neil Geismar, H. & Dawande, Milind & Sriskandarajah, Chelliah, 2005. "Approximation algorithms for k-unit cyclic solutions in robotic cells," European Journal of Operational Research, Elsevier, vol. 162(2), pages 291-309, April.
    18. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    19. Koulamas, Christos, 1998. "A new constructive heuristic for the flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 105(1), pages 66-71, February.
    20. Drobouchevitch, Inna G. & Neil Geismar, H. & Sriskandarajah, Chelliah, 2010. "Throughput optimization in robotic cells with input and output machine buffers: A comparative study of two key models," European Journal of Operational Research, Elsevier, vol. 206(3), pages 623-633, November.

    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:eee:ejores:v:169:y:2006:i:3:p:816-854. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.