Abstract
Considered to be a very general case of flow shop systems, the m-machine flow shop is the most researched system in all of flow shop theory. Beyond solving the problem under a variety of objectives and side constraints, the m-machine flow shop serves as a test bed for new methodological tools. Regarding solutions, the research presented in this chapter is rich in lower bounding schemes, dominance properties, heuristic algorithms and computational experiments measuring their success. The models considered not only deal with all the standard regular performance measures, but also application-specific objective functions. A lot of work is also available on problems with multiple objectives. We find that the most successful solutions on problems of practical size are due to metaheuristic implementations including simulated annealing, tabu search and genetic algorithms. In contrast, branch-and-bound algorithms are mostly inadequate.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adam, E. and R.J. Ebert (1992) Production & Operations Management, Fifth Edition. Prentice Hall, Englewood Cliffs, NJ.
Ahmadi, R.H. and U. Bagchi (1990) Improved Lower Bounds for Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flow Shop, European Journal of Operational Research, 44, 331–336.
Aldowaisan, T. and A. Allahverdi (2003) New Heuristics for the No-wait Flowshops to Minimize Makespan, Computers and Operations Research, 30, 1219–1231.
Allahverdi, A. (2004) A New Heuristic for m-machine Flowshop Scheduling Problem with Bicriteria of Makespan and Maximum Tardiness, Computers and Operations Research, 31, 157–180.
Bagga, P.C. and N.K. Chakravarti (1968) Optimal m-Stage Production Schedule, Journal of the Canadian Operations Research Society, 6, 71–78.
Baker, K.R. (1975) A Comparative Study of Flow-Shop Algorithms, Operations Research, 23, 62–73.
Bansal, S.P. (1977) Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flow Shop – a Branch-and-Bound Algorithm, AIIE, 9, 306–311.
Ben-Daya, M. and M. Al-Fawzan (1998) A Tabu Search Approach for the Flow Shop Scheduling Problem, European Journal of Operational Research, 109, 88–95.
Bonney, M. and S. Gundry (1976) Solutions to the Constrained Flowshop Sequencing Problem, Operational Research Quarterly, 27, 869–883.
Burns, F. and J. Rooker (1976) Johnson’s Three-machine Flow Shop Conjecture, Operations Research, 24, 578–580.
Burns, F. and J. Rooker (1978) Three Stage Flow Shops with Regressive Second Stage, Operations Research, 26, 207–208.
Campbell, H.G., R.A. Dudek and M.L. Smith (1970) A Heuristic Algorithm for the n Job m Machine Sequencing Problem, Management Science, 16, B630–B637.
Chakravarthy, K. and C. Rajendran (1999) A Heuristic for Scheduling in a Flowshop with the Bicriteria of Makespan and Maximum Tardiness Minimization, Production Planning and Control, 10, 707–714.
Chen, C.-L., V.S. Vempati and N. Aljaber (1995) An Application of Genetic Algorithms for Flow Shop Problems, European Journal of Operational Research, 80, 389–396.
Chung, C.-S., J. Flynn and O. Kirca (2006) A Branch and Bound Algorithm to Minimize Total Tardiness for m-machine Permutation Flowshop Problems, European Journal of Operational Research, 174, 1–10.
Colin, R.R. (1995) A Genetic Algorithm for Flowshop Sequencing, Computers and Operations Research, 22, 5–13.
Daniels, R.L. and R.J. Chambers (1990) Multiobjective Flow-Shop Scheduling, Naval Research Logistics, 37, 981–995.
Dannenbring, D.G. (1977) An Evaluation of Flow-shop Sequencing Heuristics, Management Science, 23, 1174–1182.
Davoud Pour, H. (2001) A New Heuristic for the n-job m-machine Flow-shop Problem, Production Planning and Control, 12, 648–653.
Demirkol, E., S. Mehta and R. Uzsoy (1998) Benchmarks for Shop Scheduling Problems, European Journal of Operational Research, 109, 137–141.
Dong, X., H. Huang, and P. Chen (2008) An Improved NEH-based Heuristic for the Permutation Flowshop Problem, Computers & Operations Research, 35, 3962-3968.
Du, J. and J.Y.T. Leung (1990) Minimizing Total Tardiness on One Machine is NP-hard, Operations Research, 38, 22–36.
Dudek, R.A. and O.F. Teuton, Jr. (1964) Development of M-Stage Decision Rule for Scheduling n Jobs Through M-Machines, Operations Research, 12, 471–497.
Eberhard, R. and J. Kennedy (1995) A New Optimizer Using Particle Swarm Theory, in Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 39–43.
Eck, B. and M. Pinedo (1988) On the Minimization of the Flow Time in Flexible Flow Shops, Technical Report, Dept. of Industrial Engineering and Operations Research, Columbia University, New York.
Etiler, O., B. Toklu, M. Atak and J. Wilson (2004) A Genetic Algorithm for Flow Shop Scheduling Problems, Journal of the Operational Research Society, 55, 830–835.
Framinan, J.M. and R. Leisten (2006) A Heuristic for Scheduling a Permutation Flowshop with Makespan Objective Subject to Maximum Tardiness, International Journal of Production Economics, 99, 28–40.
Framinan, J.M., R. Leisten and R. Ruiz-Usano (2002) Efficient Heuristics for Flowshop Sequencing with the Objectives of Makespan and Flowtime Minimisation, European Journal of Operational Research, 141, 559–569.
Framinan, J.M., R. Leisten and C. Rajendran (2003) Different Initial Sequences for the Heuristic of Nawaz, Enscore and Ham to Minimize Makespan, Idletime or Flowtime in the Static Permutation Flowshop Sequencing Problem, International Journal of Production Research, 41, 121–148.
Garey, M.R., D.S. Johnson and R. Sethi (1976) The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, 1, 117–129.
Gajpal, Y. and C. Rajendran (2006) An Ant-colony Optimization Algorithm for Minimizing the Completion-time Variance of Jobs in Flowshops, International Journal of Production Economics, 101, 259–272.
Gelders, L.F. and N. Sambandam (1978) Four Simple Heuristics for Scheduling a Flow-Shop, International Journal of Production Research, 16, 221–231.
Glover, F. (1989) Tabu Search. Part I, ORSA Journal of Computing, 1, 190–206.
Glover, F. (1990) Tabu Search. Part II, ORSA Journal of Computing, 2, 4–32.
Gonzalez, T. and S. Sahni (1978) Flowshop and Jobshop Schedules: Complexity and Approximation, Operations Research, 26, 36–52.
Gowrishankar, K., C. Rajendran and G. Srinivasan (2001) Flow Shop Scheduling Algorithms for Minimizing the Completion Time Variance and the Sum of Squares of completion Time Deviations from a Common Due Date, European Journal of Operational Research, 132, 643–665.
Grabowski, J. (1980) On Two-machine Scheduling with Release and Due Dates to Minimize Maximum Lateness, Opsearch, 17, 133–154.
Grabowski, J. and J. Pempera (2001) New Block Properties for the Permutation Flow Shop Problem with Application in Tabu Search, Journal of the Operational Research Society, 52, 210–220.
Grabowski, J., E. Skubalska and C. Smutnicki (1983) On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness, Journal of the Operational Research Society, 34, 615–620.
Grabowski, J. and M. Wodecki (2004) A Very Fast Tabu Search Algorithm for the Permutation Flow Shop Problem with Makespan Criterion, Computers and Operations Research, 31, 1891–1909.
Gupta, J.N.D. (1971) An Improved Combinatorial Algorithm for the Flowshop Scheduling Problem, Operations Research, 19, 1753–1758.
Gupta, J.N.D. (1971) A Functional Heuristic Algorithm for the Flow-shop Scheduling Problem, Operational Research Quarterly, 22, 39–47.
Gupta, J.N.D. (1972) Heuristic Algorithms for the Multistage Flowshop Problem, AIIE Transactions, 4, 11–18.
Hansen, P. and N. Mladenovic (2001) Variable Neighborhood Search: Principles and Applications, European Journal of Operational Research, 130, 449–467.
Hariri, A.M.A. and C.N. Potts (1989) A Branch and Bound Algorithm to Minimize the Number of Late Jobs in a Permutation Flow-shop, European Journal of Operational Research, 38, 228–237.
Hasija, S. and C. Rajendran (2004) Scheduling in Flowshops to Minimize Total Tardiness of Jobs, International Journal of Production Research, 42, 2289–2301.
Ho, J.C (1995) Flowshop Sequencing with Mean Flowtime Objective, European Journal of Operational Research, 81, 571–578.
Ho, J.C and Y.-L. Chang (1991) A New Heuristic for the n-job, M-machine Flow-shop Problem, European Journal of Operational Research, 52, 194–202.
Holland, J.H. (1992) Genetic Algorithms, New York: Scientific American.
Hundal, T.S. and J. Rajgopal (1988) An Extension of Palmer’s Heuristic for the Flow-shop Scheduling problem, International Journal of Production Research, 26, 1119–1124.
Ignall, E. and L. Schrage (1965) Application of the Branch and Bound Technique to Some Flow Shop Scheduling Problems, Operations Research, 13, 400–412.
Ishibuchi, H., S. Misaki and H. Tanaka (1995) Modified Simulated Annealing Algorithms for the Flow Shop Sequencing Problem, European Journal of Operational Research, 81, 388–398.
Jackson, J.R. (1955) Scheduling a Production Line to Minimize Maximum Tardiness, Research Report 43, Management Science Research Project, University of California, Los Angeles.
Jacobs, L.W. and M.J. Brusco (1995) A Local Search Heuristic for Large Set Covering Problems, Naval research Logistics Quarterly, 42, 1129–1140.
Johnson, S.M. (1954) Optimal Two- and Three-Stage Production Schedules with Setup Times Included, Naval Research Logistics Quarterly, 1, 61–68.
Karabati, S. and P. Kouvelis (1993) The Permutation Flow shop Problem with Sum-of-Completion-Times Performance Criterion, Naval Research Logistics, 40, 843–862.
Kennedy, J. and R. Eberhard (1995) Particle Swarm Optimization, Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, USA, 1942-1948.
Kim, Y.-D. (1995) Minimizing Total Tardiness in Permutation Flowshops, European Journal of Operational Research, 85, 541–555.
Kim, Y.-D., H.G. Lim and M.W. Park (1996) Search Heuristics for a Flowshop Scheduling Problem in a Printed Circuit Board Assembly Process, European Journal of Operational Research, 91, 124–143.
Koulamas, C. (1998) A New Constructive Heuristic for the Flowshop Scheduling Problem, European Journal of Operational Research, 105, 66–71.
Krone, M.J. and K. Steiglitz (1974) Heuristic Programming Solution of a Flowshop Scheduling Problem, Operations Research, 22, 629–638.
Lageweg, B.J., J.K. Lenstra and A.H.G. Rinnooy Kan (1978) A General Bounding Scheme for the Permutation Flow-Shop Problem, Operations Research, 26, 53–67.
Liu, B., L. Wang, and Y.-H. Jin (2007) An Effective PSO-based memetic algorithm for Flow Shop Scheduling, IEEE Transactions on Man and Cybernetics, B37, 18–27.
Liu, J. and C.R. Reeves (2001) Constructive and Composite Heuristic Solutions to the P||ΣCi Scheduling Problem, European Journal of Operational Research, 132, 439–452.
Lomnicki, Z. (1965) A Branch and Bound Algorithm for the Exact Solution of the Three-machine Scheduling Problem, Operational Research Quarterly, 16, 89–100.
Lourenco, H.R. (1996) Sevast’janov’s Algorithm for the Flow Shop Scheduling Problem, European Journal of Operational Research, 91, 176–189.
Lourenco, H.R., O. Martin and T. Stützle (2002) Iterated Local Search, in Handbook of Metaheuristics, F. Glover and G. Kochenberger (eds.), Kluwer Academic Publishers, Norwell MA, 321–353.
Marchiori, E. and A. Steenbeek (2000) An Evolutionary Algorithm for Large Set Covering Problems with Applications to Airline Crew Scheduling, in Real-world Applications of Evolutionary Computing, S. Cagnoni et al. (eds.), EvoWorkshops 2000, Lecture Notes in Computer Science, Springer-Verlag, Berlin 1803, 367–381.
Moccellin, J.a.V. (1995) A New Heuristic Method for the Permutation Flow Shop Scheduling Problem, Journal of the Operational Research Society, 46, 883–886.
Moccellin, J.a.V. and M.O. dos Santos (2000) An Adaptive Hybrid Metaheuristic for the Permutation Flow Shop Scheduling Problem, Control and Cybernetics, 29, 761–771.
Monma, C.L. and A.H.G. Rinnooy Kan (1983) A Concise Survey of Efficiently Solvable Special Cases of the Permutation Flow-Shop Problem, RAIRO Recherche Operationelle, 17, 105–119.
Murata, T., H. Ishibuchi and H. Tanaka (1996) Genetic Algorithms for Flowshop Scheduling Problems, Computers and Industrial Engineering, 30, 1061–1071.
Nawaz, M., E.E. Enscore Jr. and I. Ham (1983) A Heuristic Algorithm for the m-machine n-Job Flow-shop Sequencing Problem, OMEGA, 11, 91–95.
Nowicki, E. and C. Smutnicki (1989) Worst-case Analysis of an Approximation Algorithm for Flow-shop Scheduling, Operations Research Letters, 8, 171–177.
Nowicki, E. and C. Smutnicki (1991) Worst-case Analysis of Dannenbring’s Algorithm for Flow-shop Scheduling, Operations Research Letters, 10, 473–480.
Nowicki, E. and C. Smutnicki (1993) New Results in the Worst-case Analysis for Flow-shop Scheduling, Discrete Applied Mathematics, 46, 21–41.
Nowicki, E. and C. Smutnicki (1994) A Note on Worst-case Analysis of Approximation Algorithms for a Scheduling Problem, European Journal of Operational Research, 74, 128–134.
Nowicki, E. and C. Smutnicki (1996) A Fast Tabu Search Algorithm for the Permutation Flow-shop Problem, European Journal of Operational Research, 91, 160–175.
Ogbu, F. and D. Smith (1990a) The application of the Simulated Annealing Algorithm to the Solution of the n/m/Cmax Flowshop Problem, Computers and Operations Research, 17, 243–253.
Ogbu, F. and D. Smith (1990b) Simulated Annealing for the Permutation Flowshop Problem, OMEGA, 19, 64–67.
Onwubolu, G. and D. Davendra (2006) Scheduling Flow Shops Using Differential Evolution Algorithm, European Journal of Operational Research, 171, 674–692.
Osman, I.H. and C.N. Potts (1989) Simulated Annealing for Permutation Flowshop Scheduling, OMEGA, 6, 551–557.
Page, E.S. (1961) An Approach to Scheduling Jobs on Machines, Journal of the Royal Statistical Society, Series B, 23, 484–492.
Palmer, D.S (1965) Sequencing Jobs Through a Multi-stage Process in The Minimum Total Time – A Quick Method of Obtaining a Near Optimum, Operational Research Quarterly, 16, 101–107.
Panwalkar, S.S. and A.W. Khan (1976) An Ordered Flow-Shop Sequencing Problem with Mean Completion Time Criterion, International Journal of Production Research, 14, 631–635.
Park, Y.B. (1981) A Simulation Study and an Analysis for Evaluation of Performance-Effectiveness of Flowshop Sequencing Heuristics: A static and a Dynamic Flowshop Model, Master’s Thesis, Pennsylvania State University.
Parthasarathy, S. and C. Rajendran (1997) A Simulated Annealing Heuristic for Scheduling to Minimize Mean Weighted Tardiness in a Flowshop with Sequence Dependent Setup Times of Jobs – a Case Study, Production Planning and Control, 8, 475–483.
Ponnambalam, S.G., P. Aravindan and S. Chandrashekaran (2001) Constructive and Improvement Flow Shop Scheduling Heuristics: An Extensive Evaluation, Production Planning and Control, 12, 335–344.
Potts, C.N., D.B. Shmoys and D.P. Williamson (1991) Permutation vs. Nonpermutation Flow Shop Schedules, Operations Research Letters, 10, 281–284.
Potts, C.N., L.N. Van Wassenhove (1982) A Decomposition Algorithm for the Single Machine Total Tardiness Problem, Operations Research Letters, 1, 177–181.
Rad, S.F., R. Ruiz, and N. Boroojerdian (2009) New High Performing Heuristics Minimizing Makespan in Permutation Flowshops, Omega, 37, 331-345.
Rajendran, C. (1993) Heuristic Algorithm for Scheduling in a Flowshop to Minimize Total Flowtime, International Journal of Production Economics, 29, 65–73.
Rajendran, C. (1994) A Heuristic for Scheduling in Flowshop and Flowline-based Manufacturing Cell with Multi-criteria, International Journal of Production Research, 32, 2541–2558.
Rajendran, C. (1995) Heuristics for Scheduling in Flowshop with Multiple Objectives, European Journal of Operational Research, 82, 540–555.
Rajendran, C. and H. Ziegler (1999) Heuristics for Scheduling in Flowshops and Flowline-Based Manufacturing Cells to Minimize the Sum ofWeighted Flowtime and Weighted Tardiness of Jobs, Computers and Industrial Engineering, 37, 671–690.
Rajendran, C. and H. Ziegler (2004) Ant-Colony Algorithms for Permutation Flowshop Scheduling to Minimize Makespan/Total Flowtime of Jobs, European Journal of Operational Research, 155, 426–438.
Reeves, C.R. (1993) Improving the Efficiency of the Tabu Search for Machine Scheduling Problems, Journal of the Operational Research Society, 44, 375–382.
Reeves, C.R. (1995) A Genetic Algorithm for Flowshop Sequencing, Computers and Operations Research, 22, 5–13.
Reeves, C.R. and T. Yamada (1998) Genetic Algorithms, Path Relinking, andthe Flowshop Sequencing Problem, Evolutionary Computation, 6, 45–60.
Reid, R.A. and W.A. Stark, Jr. (1982) Job Sequencing Program Minimizes Processing Time, Industrial Engineering, 14, 26–33.
Ruiz, R. and A. Allahverdi (2009) Minimizing the Bicriteria of Makespan and Maximum Tardiness with an Upper Bound on Maximum Tardiness, Computers and Operations Research, 36, 1268–1283.
Ruiz, R. and C. Maroto (2005) A Comprehensive Review and Evaluation of Permutation Flowshop Heuristics, European Journal of Operational Research, 165, 479–494.
Ruiz, R., C. Maroto and J. Alcaraz (2006) Two New Robust Genetic Algorithms for the Flowshop Scheduling Problem, OMEGA, 34, 461–476.
Ruiz, R. and T. Stützle (2007) A Simple and Effective Iterated Greedy Algorithm for the Permutation Flowshop Scheduling Problem, European Journal of Operational Research, 177, 2033–2049.
Sarin, S.C. and P. Jaiprakash (2007) Flow Shop Lot Streaming, Springer, New York, NY.
Sarin, S. and M. Lefoka (1993) Scheduling Heuristic for the n-job m-machine Flow Shop, OMEGA, 21, 229–234.
Sevast’janov, S. (1994) Nonstrict Vector Summation in scheduling problems (in Russian), Sibirsk. Zh. Issled. Oper., 1, 67–99.
Sevast’janov, S. (1995) Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops, Mathematics of Operations Research, 20, 90–103.
Sevast’janov, S. (1997) Nonstrict Vector Summation in the Plane and its Applications to Scheduling Problems, in Operations Research and Discrete Analysis, A.D. Korshunov (ed.), Kluwer Academic Publishers, 241–272.
Shanthikumar, J.G. and Y.B. Wu (1985) Decomposition Approaches in Permutation Scheduling Problems with Application to the m-machine Flow Shop Scheduling Problems, European Journal of Operational Research, 19, 125–141.
Sidney, J.B. (1973) An Extension of Moore’s Due Date Algorithm, in S.E. Elmaghraby (ed.), Symposium on the Theory of Scheduling, Springer, Berlin, 393–398.
Smith, R.D. and R.A. Dudek (1967) A General Algorithm for Solution of the n-Job M -machine Sequencing Problem of the Flow Shop, Operations Research, 15, 71–82.
Smith, R.D. and R.A. Dudek (1969) A General Algorithm for Solution of the n-Job M-machine Sequencing Problem of the Flow Shop, Errata, Operations Research, 17, 756.
Smith, M.L., S.S. Panwalkar and R.A. Dudek (1976) Flow Shop Sequencing Problem with Ordered Processing Time Matrices: A General Case, Naval Research Logistics Quarterly, 23, 481–486.
Smits, A.J.M. and K.R. Baker (1981) An Experimental Investigation of the Occurrence of Special Cases in the Three-machine Flowshop Problem, International Journal of Production Research, 19, 737–741.
Sridhar, J. and C. Rajendran (1996) Scheduling of Flowshops and Cellular Manufacturing Systems with Multiple Objectives - a Genetic Algorithmic Approach, Production Planning and Control, 7, 374–382.
Stafford, E.F. (1988) On the Development of a Mixed Integer Linear Programming Model for the Flowshop Sequencing Problem, Journal of the Operational Research Society, 39, 1163–1174.
Stinson, J.P. and A.W. Smith (1982) A Heuristic Programming Procedure for Sequencing the Static Flowshop, International Journal of Production Research, 20, 753–764.
Storn, R. and K. Price (1995) Differential Evolution – a Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces, Technical Report, TR-95-012, ICSI, March 1999.
Stützle, T. (1998a) An Ant Approach for the Flow Shop Problem, Proceedings of the Sixth European Congress on Intelligent Techniques & Soft Computing (EUFIT’98), 3, Verlag Mainz, Aachen, Germany, 1560–1564.
Stützle, T. (1998b) Applying Iterated Local Search to the Permutation Flow Shop Problem, Technical Report, AIDA-98-04 FG Intellektik, TU Darmstadt.
Stützle, T. and H.H. Hoos (2000) Max-min Ant System, Future Generation Computer Systems, 16, 889–914.
Sule, D.R. (1982) Sequencing n Jobs on Two Machines with Setup, Processing, and Removal Times Separated, Naval Research Logistics Quarterly, 29, 517–519.
Suliman, S.M.A. (2000) A Two-Phase Heuristic Approach to the Permutation Flow-Shop Scheduling Problem, International Journal of Production Economics, 64, 143–152.
Szwarc, W. (1971) Elimination Methods in the m × n Sequencing Problem, Naval Research Logistics Quarterly, 18, 295–305.
Szwarc, W. (1973) Optimal Elimination Methods in the m × n Flow Shop Scheduling Problem, Operations Research, 21, 1250–1259.
Szwarc, W. (1977) Optimal Two-machine Orderings in the 3 × n Flow-Shop Problem, Operations Research, 25, 70–77.
Szwarc, W. (1983a) The Flow-Shop Problem with Mean Completion Time Criterion, Technical Note, IIE Transactions, 15, 172–176.
Szwarc, W. (1983b) Flow Shop Problems with Time Lags, Management Science, 29, 477–481.
Taillard, E. (1990) Some Efficient Heuristic Methods for the Flowshop Sequencing Problem, European Journal of Operational Research, 47, 67–74.
Taillard, E. (1993) Benchmarks for Basic Scheduling Problems, European Journal of Operational Research, 64, 278–285.
Tasgetiren, M.F., Y.-C. Liang, M. Sevkli, and G. Gencyilmaz (2007) A Particle Swarm Optimization Algorithm for Makespan and Flowtime Minimization in the Permutation Flowshop Sequencing Problem, European Journal of Operational Research, 177, 1930–1947.
Turner, S. and D. Booth (1987) Comparison of Heuristics for Flow Shop Sequencing, OMEGA, 15, 75–78.
Vallada, E., R. Ruiz and G. Minella (2008) Minimising Total Tardiness in the m -machine Flowshop Problem: A Review and Evaluation of Heuristics and Metaheuristics, Computers & Operations Research, 35, 1350–1373.
Van Laarhoven, P.J.M. and E.H.L. Aarts (1987) Simulated Annealing: Theory and Applications, Reidel, Dordrecht, The Netherlands.
Wang, C., C. Chu and J.-M. Proth (1997) Heuristic Approaches for n|m|F|ΣCi Scheduling Problems, European Journal of Operational Research, 96, 636–644.
Wang, L. and D.Z. Zheng (2003) An Effective Hybrid Heuristic for Flow Shop Scheduling, The International Journal of Advanced Manufacturing Technology, 21, 38–44.
Watson, J.P., L. Barbulescu, L.D. Whitley, and A.E. Howe (2002) Contrasting Structured and random Permutation Flowshop Scheduling Problems: Search Space Topology and Algorithm Performance, ORSA Journal of Computing, 14, 98–123.
Werner, F. (1993) On the Heuristic Solution of the Permutation Flow-shop Problem by Path Algorithms, Computers and Operations Research, 20, 707–722.
Widmer, M. and A. Hertz (1989) A New Heuristic Method for the Flow Shop Sequencing Problem, European Journal of Operational Research, 41, 186–193.
Williams, E.F., S. Tufekci and M. Akansel (1997) O(m2) Algorithms for the Two and Three Sublot Lot Streaming Problem, Production and Operations Management, 6, 74–96.
Woo, H.S. and D.S. Yim (1998) A Heuristic Algorithm for Mean Flowtime Objective in Flowshop Scheduling, Computers and Operations Research, 25, 175–182.
Ying, K.-C. and C.-J. Liao (2004) An Ant Colony System for Permutation Flow-Shop Sequencing, Computers and Operations Research, 31, 791–801.
Yoshida, T. and K. Hitomi (1979) Optimal Two-Stage Production Scheduling with Setup Times Separated, AIIE Transactions, 11, 261–263.
Zegordi, S.H., K. Itoh and T. Enkawa (1995) Minimizing Makespan for Flowshop Scheduling by Combining Simulated Annealing with Sequencing Knowledge, European Journal of Operational Research, 85, 515–531.
Zobolas, G.I., C.D. Tarantilis and G. Iaonnou (2009) Minimizing Makespan in Permutation Flow Shop Scheduling Problems Using a Hybrid Metaheuristic Algorithm, Computers and Operations Research, 36, 1249–1267.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Emmons, H., Vairaktarakis, G. (2013). The m-Machine Flow Shop. In: Flow Shop Scheduling. International Series in Operations Research & Management Science, vol 182. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-5152-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5152-5_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-5151-8
Online ISBN: 978-1-4614-5152-5
eBook Packages: Business and EconomicsBusiness and Management (R0)