Skip to main content

2017 | OriginalPaper | Buchkapitel

10. A Critical Sight to the NEH Heuristic

verfasst von : Ramón Companys, Imma Ribas

Erschienen in: Advances in Management Engineering

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

This paper analyses the behaviour of the insertion procedure of the NEH heuristics due to in some cases the procedure does not improve the solution quality. This fact is observed specially in the NEH-based heuristics that have been proposed in the literature of the blocking flow shop problem. As a result of this work, we recommend to evaluate the sequence before and after the insertion phase in order to retain the best of both.

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!

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!

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!

Literatur
Zurück zum Zitat Companys, R. (1966). Métodos heurísticos en la resolución del problema del taller mecánic. Estudios Empresariales, 5(2), 7–18.MathSciNet Companys, R. (1966). Métodos heurísticos en la resolución del problema del taller mecánic. Estudios Empresariales, 5(2), 7–18.MathSciNet
Zurück zum Zitat Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23(1), 1174–1182.CrossRefMATH Dannenbring, D. G. (1977). An evaluation of flow shop sequencing heuristics. Management Science, 23(1), 1174–1182.CrossRefMATH
Zurück zum Zitat Dong, X., Huang, H., & Chen, P. (2008). An improved NEH-based heuristic for the permutation flowshop problem. Part Special Issue: Telecommunications Network Engineering, 35(12), 3962–3968.MATH Dong, X., Huang, H., & Chen, P. (2008). An improved NEH-based heuristic for the permutation flowshop problem. Part Special Issue: Telecommunications Network Engineering, 35(12), 3962–3968.MATH
Zurück zum Zitat Fernandez-Viagas, V., & Framinan, J. M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53(4), 1111–1123.CrossRef Fernandez-Viagas, V., & Framinan, J. M. (2014). A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research, 53(4), 1111–1123.CrossRef
Zurück zum Zitat Framinan, J. M., & Leisten, R. (2003). An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 31(4), 311–317.CrossRef Framinan, J. M., & Leisten, R. (2003). An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega, 31(4), 311–317.CrossRef
Zurück zum Zitat Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.MathSciNetCrossRefMATH Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.MathSciNetCrossRefMATH
Zurück zum Zitat Gupta, J. N. D. (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly, 22(1), 39–47.MathSciNetCrossRefMATH Gupta, J. N. D. (1971). A functional heuristic algorithm for the flow shop scheduling problem. Operational Research Quarterly, 22(1), 39–47.MathSciNetCrossRefMATH
Zurück zum Zitat Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Part Special Issue: Bio-Inspired Methods in Combinatorial Optimization, 35(9), 3001–3008.MathSciNetMATH Kalczynski, P. J., & Kamburowski, J. (2008). An improved NEH heuristic to minimize makespan in permutation flow shops. Part Special Issue: Bio-Inspired Methods in Combinatorial Optimization, 35(9), 3001–3008.MathSciNetMATH
Zurück zum Zitat Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28(11), 2085.CrossRefMATH Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28(11), 2085.CrossRefMATH
Zurück zum Zitat Lomnicki, Z. A. (1965). A branch and bound algorithm for the exact solution of three machine scheduling problems. Operational Research Quarterly, 16(1), 89–100.CrossRef Lomnicki, Z. A. (1965). A branch and bound algorithm for the exact solution of three machine scheduling problems. Operational Research Quarterly, 16(1), 89–100.CrossRef
Zurück zum Zitat McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research, 37, 925–936.CrossRefMATH McCormick, S. T., Pinedo, M. L., Shenker, S., & Wolf, B. (1989). Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research, 37, 925–936.CrossRefMATH
Zurück zum Zitat Nagano, M. S., & Moccellin, J. V. (2002). A high quality constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, 53, 1374–1379.CrossRefMATH Nagano, M. S., & Moccellin, J. V. (2002). A high quality constructive heuristic for flow shop sequencing. Journal of the Operational Research Society, 53, 1374–1379.CrossRefMATH
Zurück zum Zitat Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.CrossRef Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95.CrossRef
Zurück zum Zitat 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.CrossRef 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.CrossRef
Zurück zum Zitat Pan, Q.-K., & Wang, L. (2012). Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega, 40(2), 218–229.CrossRef Pan, Q.-K., & Wang, L. (2012). Effective heuristics for the blocking flowshop scheduling problem with makespan minimization. Omega, 40(2), 218–229.CrossRef
Zurück zum Zitat Ribas, I., Companys, R., & Tort-Martorell, X. (2011). An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega, 39(3), 293–301.CrossRef Ribas, I., Companys, R., & Tort-Martorell, X. (2011). An iterated greedy algorithm for the flowshop scheduling problem with blocking. Omega, 39(3), 293–301.CrossRef
Zurück zum Zitat Ribas, I., Companys, R., & Tort-Martorell, X. (2013). A competitive variable neighbourhood search algorithm for the blocking flowshop problem. European J. of Industrial Engineering, 7(6), 729–754.CrossRef Ribas, I., Companys, R., & Tort-Martorell, X. (2013). A competitive variable neighbourhood search algorithm for the blocking flowshop problem. European J. of Industrial Engineering, 7(6), 729–754.CrossRef
Zurück zum Zitat Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87(1), 39–48.CrossRef Ronconi, D. P. (2004). A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics, 87(1), 39–48.CrossRef
Zurück zum Zitat Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65–74.MathSciNetCrossRefMATH Taillard, E. (1990). Some efficient heuristic methods for the flow shop sequencing problem. European Journal of Operational Research, 47(1), 65–74.MathSciNetCrossRefMATH
Metadaten
Titel
A Critical Sight to the NEH Heuristic
verfasst von
Ramón Companys
Imma Ribas
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-55889-9_10

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.