• Jose M. Framinan
  • Rainer Leisten
  • Rubén Ruiz García


The framework for manufacturing scheduling envisioned in Chap.  1 presented three main blocks—models, methods and tools—that, together with the humans involved in the process, compose a scheduling system. This part of the book deals with scheduling models, and in Chaps.  3 and  4 we have reviewed the mainelements of these models concerning systems layouts and processing constraints, respectively.


Completion Time Idle Time Schedule Model Total Completion Time Machine Utilisation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Baker, K. R. (1974). Introduction to Sequencing and Scheduling. John Wiley & Sons, New York.Google Scholar
  2. Baker, K. R. and Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: a review. Mathematics of Operations Research, 15:483–495.Google Scholar
  3. Baker, K. R. and Trietsch, D. (2009). Principles of Sequencing and Scheduling. Wiley, New York.Google Scholar
  4. Błazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., and Wȩglarz, J. (2002). Scheduling Computer and Manufacturing Processes. Springer-Verlag, Berlin, second edition.Google Scholar
  5. Brucker, P. (2007). Scheduling Algorithms. Springer, New York, fifth edition.Google Scholar
  6. Cheng, T. C. E. and Sin, C. C. S. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3):271–292.Google Scholar
  7. Conway, R. W., Maxwell, W. L., and Miller, L. W. (1967). Theory of Scheduling. Dover Publications, New York. Unabridged publication from the 1967 original edition published by Addison-Wesley.Google Scholar
  8. Framinan, J. M., Gupta, J. N. D., and Leisten, R. (2004). A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. Journal of the Operational Research Society, 55(12):1243–1255.Google Scholar
  9. French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood Limited, Chichester.Google Scholar
  10. Gary, K., Uzsoy, R., Smith, S. P., and Kempf, K. (1995). Measuring the quality of manufacturing schedules. In Brown, D. E. and Scherer, W. T., editors, Intelligent Scheduling Systems, volume 4 of Operations Research/Computer Science Interfaces, pages 129–154, Dordrecht. Kluwer Academic Publishers.Google Scholar
  11. Gupta, J. N. D. and Dudek, R. A. (1971). Optimality Criteria for Flowshop Schedules. IIE Transactions, 3(3):199–205.Google Scholar
  12. Hejazi, S. R. and Saghafian, S. (2005). Flowshop-scheduling problems with makespan criterion: a review. International Journal of Production Research, 43(14):2895–2929.Google Scholar
  13. Jozefowska, J. (2007). Just-in-Time Scheduling. Springer, Berlin.Google Scholar
  14. Kanet, J. J. and Sridharan, V. (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. Operations Research, 48(1):99–110.Google Scholar
  15. Linn, R. and Zhang, W. (1999). Hybrid flow shop scheduling: A survey. Computers & Industrial Engineering, 37(1–2):57–61.Google Scholar
  16. MacCarthy, B. L. and Wilson, J. R., editors (2001). Human performance in Planning and Scheduling. Taylor & Francis.Google Scholar
  17. Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18(2):193–242.Google Scholar
  18. Pinedo, M. (2009). Planning and Scheduling in Manufacturing and Services. Springer, New York, second edition.Google Scholar
  19. Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer, New York, fourth edition.Google Scholar
  20. Quadt, D. and Kuhn, D. (2007). A taxonomy of flexible flow line scheduling procedures. European Journal of Operational Research, 178(3):686–698.Google Scholar
  21. Ribas, I., Leisten, R., and Framinan, J. M. (2010). Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Computers & Operations Research, 37(8):1439–1454.Google Scholar
  22. Ruiz, R. and Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2):479–494.Google Scholar
  23. Ruiz, R. and Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3):781–800.Google Scholar
  24. Ruiz, R. and Vázquez-Rodríguez, J. A. (2010). The hybrid flowshop scheduling problem. European Journal of Operational Research, 205(1):1–18.Google Scholar
  25. Sen, T. and Gupta, S. K. (1984). A state-of-art survey of static scheduling research involving due dates. OMEGA, The International Journal of Management Science, 12(1):63–76.Google Scholar
  26. Stoop, P. and Wiers, V. (1996). The complexity of scheduling in practice. International Journal of Operations and Production Management, 16(10):37–53.Google Scholar
  27. T’Kindt, V. and Billaut, J.-C. (2006). Multicriteria Scheduling: Theory, Models and Algorithms. Springer, New York, second edition.Google Scholar
  28. Vallada, E., Ruiz, R., and Minella, G. (2008). Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4):1350–1373.Google Scholar
  29. Vignier, A., Billaut, J.-C., and Proust, C. (1999). Les problèmes d’ordonnancement de type flow-shop hybride: État de l’art. RAIRO Recherche opérationnelle, 33(2):117–183. In French.Google Scholar
  30. Wang, H. (2005). Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Systems, 22(2):78–85.Google Scholar

Copyright information

© Springer-Verlag London 2014

Authors and Affiliations

  • Jose M. Framinan
    • 1
  • Rainer Leisten
    • 2
  • Rubén Ruiz García
    • 3
  1. 1.Departamento Organización Industrial y Gestión de EmpresasUniversidad de Sevilla Escuela Superior de IngenierosIsla de la CartujaSpain
  2. 2.Fakultät für Ingenieurwissenschaften Allgemeine Betriebswirtschaftslehre und Operations ManagementUniversität Duisburg-EssenDuisburgGermany
  3. 3.Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de InformáticaUniversitat Politècnica de ValènciaValenciaSpain

Personalised recommendations