Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction Kapitel lesen Erstes Kapitel lesen

2016 | OriginalPaper | Buchkapitel

6. Flow Shops and Flexible Flow Shops (Deterministic)

verfasst von : Michael L. Pinedo

Erschienen in: Scheduling

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In many manufacturing and assembly facilities each job has to undergo a series of operations. Often, these operations have to be done on all jobs in the same order implying that the jobs have to follow the same route. The machines are then assumed to be set up in series and the environment is referred to as a flow shop.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Parallel Machine Models (Deterministic)
Nächstes Kapitel Job Shops (Deterministic)
Literatur
C. Akkan and S. Karabati (2004) “The Two-Machine Flowshop Total Completion Time Problem: Improved Lower Bounds and a Branch-and-Bound Algorithm”, European Journal of Operational Research, Vol. 159, pp. 420–429.CrossRefMathSciNetMATH
H.G. Campbell, R.A. Dudek and M.L. Smith (1970) “A Heuristic Algorithm for the n Job m Machine Sequencing Problem”, Management Science, Vol. 16, pp. B630–B637.CrossRefMATH
B.-C. Choi, J. Y.-T. Leung, and M. Pinedo (2011) “Minimizing Makespan in an Ordered Flow Shop with Machine-Dependent Processing Times”, Journal of Combinatorial Optimization, Vol. 22, pp. 797–818.CrossRefMathSciNetMATH
D.G. Dannenbring (1977) “An Evaluation of Flowshop Sequencing Heuristics”, Management Science, Vol. 23, pp. 1174–1182.CrossRefMATH
M.W. Dawande, H.N. Geismar, S.P. Sethi, and C. Sriskandarajah (2007) Throughput Optimization in Robotic Cells, International Series in Operations Research and Management Science, Springer.MATH
F. Della Croce, M. Ghirardi, and R. Tadei (2002) “An Improved Branch-and-Bound Algorithm for the Two Machine Total Completion Time Flow Shop Problem”, European Journal of Operational Research, Vol. 139, pp. 293–301.CrossRefMathSciNetMATH
F. Della Croce, V. Narayan, and R. Tadei (1996) “The Two-Machine Total Completion Time Flow Shop Problem”, European Journal of Operational Research, Vol. 90, pp. 227–237.CrossRefMATH
J. Du and J.Y.-T. Leung (1993a) “Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops”, Journal of Algorithms, Vol. 14, pp. 24–44.CrossRefMathSciNetMATH
J. Du and J.Y.-T. Leung (1993b) “Minimizing Mean Flow Time with Release Times and Deadline Constraints”, Journal of Algorithms, Vol. 14, pp. 45–68.CrossRefMathSciNetMATH
B. Eck and M. Pinedo (1988) “On the Minimization of the Flow Time in Flexible Flow Shops”, Technical Report, Department of Industrial Engineering and Operations Research, Columbia University, New York.
M.R. Garey, D.S. Johnson and R. Sethi (1976) “The Complexity of Flowshop and Jobshop Scheduling”, Mathematics of Operations Research, Vol. 1, pp. 117–129.CrossRefMathSciNetMATH
T. Gonzalez and S. Sahni (1978b) “Flowshop and Jobshop Schedules: Complexity and Approximation”, Operations Research, Vol. 26, pp. 36–52.CrossRefMathSciNetMATH
S.K. Goyal and C. Sriskandarajah (1988) “No-Wait Shop Scheduling: Computational Complexity and Approximate Algorithms”, Opsearch, Vol. 25, pp. 220–244.MathSciNetMATH
J.N.D. Gupta (1972) “Heuristic Algorithms for the Multistage Flow Shop Problem”, AIIE Transactions, Vol. 4, pp. 11–18.CrossRef
N.G. Hall and C. Sriskandarajah (1996) “A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process”, Operations Research, Vol. 44, pp. 421–439.CrossRefMathSciNet
T.J. Hodgson and G.W. McDonald (1981a) “Interactive Scheduling of a Generalized Flow Shop. Part I: Success Through Evolutionary Development”, Interfaces, Vol. 11, No. 2, pp. 42–47.
T.J. Hodgson and G.W. McDonald (1981b) “Interactive Scheduling of a Generalized Flow Shop. Part II: Development of Computer Programs and Files”, Interfaces, Vol. 11, No. 3, pp. 83–88.
T.J. Hodgson and G.W. McDonald (1981c) “Interactive Scheduling of a Generalized Flow Shop. Part III: Quantifying User Objectives to Create Better Schedules”, Interfaces, Vol. 11, No. 4, pp. 35–41.
J.A. Hoogeveen, L. van Norden, and S.L. van de Velde (2006) “Lower Bounds for Minimizing Total Completion Time in a Two-Machine Flow Shop”, Journal of Scheduling, Vol. 9, pp. 559–568.CrossRefMathSciNetMATH
S. Hou and H. Hoogeveen (2003) “The Three Machine Proportionate Flow Shop Problem with Unequal Machine Speeds”, Operations Research Letters, Vol. 31, pp. 225–231.CrossRefMathSciNetMATH
S.M. Johnson (1954) “Optimal Two and Three-Stage Production Schedules with Setup Times Included”, Naval Research Logistics Quarterly, Vol. 1, pp. 61–67.CrossRef
E.M. Levner (1969) “Optimal Planning of Parts Machining on a Number of Machines”, Automation and Remote Control, Vol. 12, pp. 1972–1981.MathSciNet
S.T. McCormick, M. Pinedo, S. Shenker and B. Wolf (1989) “Sequencing in an Assembly Line with Blocking to Minimize Cycle Time”, Operations Research, Vol. 37, pp. 925–936.CrossRefMATH
C.L. Monma and A.H.G. Rinnooy Kan (1983) “A Concise Survey of Efficiently Solvable Special Cases of the Permutation Flow-Shop Problem”, RAIRO Recherche Operationelle, Vol. 17, pp. 105–119.MathSciNetMATH
M. Nawaz, E.E. Enscore, Jr., and I. Ham (1983) “A Heuristic Algorithm for the m-Machine, n-Job Flowshop Sequencing Problem”, Omega - the International Journal of Management Science, Vol. 11, pp. 91–95.CrossRef
P.S. Ow (1985) “Focused Scheduling in Proportionate Flowshops”, Management Science, Vol. 31, pp. 852–869.CrossRefMATH
D.S. Palmer (1965) “Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time - A Quick Method of Obtaining a Near Optimum”, Operational Research Quarterly, Vol. 16, pp. 101–107.CrossRef
C.H. Papadimitriou and P.C. Kannelakis (1980) “Flowshop Scheduling with Limited Temporary Storage”, Journal of the Association of Computing Machinery, Vol. 27, pp. 533–549.CrossRefMATH
M. Pinedo (1982) “Minimizing the Expected Makespan in Stochastic Flow Shops”, Operations Research, Vol. 30, pp. 148–162.CrossRefMathSciNetMATH
M. Pinedo (1985) “A Note on Stochastic Shop Models in which Jobs have the Same Processing Requirements on each Machine”, Management Science, Vol. 31, pp. 840–845.CrossRefMathSciNetMATH
S.S. Reddi and C.V. Ramamoorthy (1972) “On the Flowshop Sequencing Problem with No Wait in Process”, Operational Research Quarterly, Vol. 23, pp.323–330.CrossRefMATH
H. Röck (1984) “The Three-Machine No-Wait Flow Shop Problem is NP-Complete”, Journal of the Association of Computing Machinery, Vol. 31, pp. 336–345.CrossRefMATH
S. Sahni and Y. Cho (1979a) “Complexity of Scheduling Jobs with no Wait in Process”, Mathematics of Operations Research, Vol. 4, pp. 448–457.CrossRefMathSciNetMATH
N. Shakhlevich, H. Hoogeveen and M. Pinedo (1998) “Minimizing Total Weighted Completion Time in a Proportionate Flow Shop”, Journal of Scheduling, Vol. 1, pp. 157–168.CrossRefMathSciNetMATH
M.L. Smith, S.S. Panwalkar and R.A. Dudek (1975) “Flow Shop Sequencing with Ordered Processing Time Matrices”, Management Science, Vol. 21, pp. 544–549.CrossRefMathSciNetMATH
M.L. Smith, S.S. Panwalkar and R.A. Dudek (1976) “Flow Shop Sequencing Problem with Ordered Processing Time Matrices: A General Case”, Naval Research Logistics Quarterly, Vol. 23, pp. 481–486.CrossRefMathSciNetMATH
C. Sriskandarajah and S.P. Sethi (1989) “Scheduling Algorithms for Flexible Flow Shops: Worst and Average Case Performance”, European Journal of Operational Research, Vol. 43, pp. 143–160.CrossRefMathSciNetMATH
W. Szwarc (1971) “Elimination Methods in the m × n Sequencing Problem”, Naval Research Logistics Quarterly, Vol. 18, pp. 295–305.CrossRefMathSciNetMATH
W. Szwarc (1973) “Optimal Elimination Methods in the m × n Flow Shop Scheduling Problem”, Operations Research, Vol. 21, pp. 1250–1259.CrossRefMathSciNetMATH
W. Szwarc (1978) “Dominance Conditions for the Three-Machine Flow-Shop Problem”, Operations Research, Vol. 26, pp. 203–206.CrossRefMathSciNetMATH
E. Taillard (1990) “Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem”, European Journal of Operational Research, Vol. 47, pp. 65–74.CrossRefMathSciNetMATH
S.L. Van de Velde (1990) “Minimizing the Sum of the Job Completion Times in the Two-Machine Flow Shop by Lagrangian Relaxation”, Annals of Operations Research, Vol. 26, pp. 257–268.MathSciNetMATH
H.M. Wagner (1959) “An Integer Programming Model for Machine Scheduling”, Naval Research Logistics Quarterly, Vol. 6, pp. 131–140.CrossRefMathSciNet
M. Widmer and A. Hertz (1989) “A New Heuristic Method for the Flow Shop Sequencing Heuristic”, European Journal of Operational Research, Vol. 41, 186–193.CrossRefMATH
D.A. Wismer (1972) “Solution of Flowshop Scheduling Problem with No Intermediate Queues”, Operations Research, Vol. 20, pp. 689–697.CrossRefMATH
Y. Yang, S. Kreipl and M. Pinedo (2000) “Heuristics for Minimizing Total Weighted Tardiness in Flexible Flow Shops”, Journal of Scheduling, Vol. 3, pp. 89–108.CrossRefMathSciNetMATH
Metadaten
Titel
Flow Shops and Flexible Flow Shops (Deterministic)
verfasst von
Michael L. Pinedo
Copyright-Jahr
2016
Buch
Scheduling

Print ISBN: 978-3-319-26578-0

Electronic ISBN: 978-3-319-26580-3

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-26580-3_6