Skip to main content
SpringerLink
Log in

Exact Algorithms

  • Chapter
  • First Online:
Manufacturing Scheduling Systems

  • 2256 Accesses

Abstract

In the previous chapter we discussed that most scheduling models are hard to be solved optimally and that there is little hope in expecting the optimal solution from complex problems arising in real production settings.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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 

  • Crowder, H. and Padberg, M. W. (1980). Solving large-scale symmetric travelling salesman problems to optimality. Management Science, 26(5):495–509.

    Google Scholar 

  • Fanjul-Peyró, L. and Ruiz, R. (2010). Iterated greedy local search methods for unrelated parallel machine scheduling. European Journal of Operational Research, 207(1):55–69.

    Google Scholar 

  • French, S. (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood Limited, Chichester.

    Google Scholar 

  • Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.

    Google Scholar 

  • Gupta, J. N. D. and Dudek, R. A. (1971). Optimality Criteria for Flowshop Schedules. IIE Transactions, 3(3):199–205.

    Google Scholar 

  • Held, M. and Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10(1):196–210.

    Google Scholar 

  • Ignall, E. and Schrage, L. E. (1965). Application of branch- and bound technique to some flow shop problems. Operations research, 13(3):400–412.

    Google Scholar 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1:61–68.

    Google Scholar 

  • Lawler, E. L. (1973). Optimal Sequencing of a Single Machine Subject to Precedence Constraints. Management Science, 19(5):544–546.

    Google Scholar 

  • Leisten, R. (1990). Flowshop sequencing problems with limited buffer storage. International Journal of Production Research, 28(11):2085.

    Google Scholar 

  • Lenstra, J. K., Rinnooy Kan, A. H. G., and Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343–362.

    Google Scholar 

  • Lenstra, J. K., Shmoys, D. B., and Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46(3):259–271.

    Google Scholar 

  • Liao, C.-J. and You, C.-T. (1992). An improved formulation for the job-shop scheduling problem. Journal of the Operational Research Society, 43(11):1047–1054.

    Google Scholar 

  • Manne, A. S. (1960). On the job-shop scheduling problem. Operations Research, 8(2):219–223.

    Google Scholar 

  • Moore J. (1968). An \(n\) job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15 (1):102–109.

    Google Scholar 

  • Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and combinatorial optimization. Wiley, New York.

    Google Scholar 

  • Pinedo, M. L. (2012). Scheduling: Theory, Algorithms, and Systems. Springer, New York, fourth edition.

    Google Scholar 

  • Potts, C. N. (1980). An adaptive branching rule for the permutation flow-shop problem. Elsevier, Amsterdam.

    Google Scholar 

  • Rinnooy Kan, A., Lageweg, B., and Lenstra, J. (1975). Minimizing total costs in one-machine scheduling. Operations Research, 23(5):908–927.

    Google Scholar 

  • Schrage, L. E. and Baker, K. R. (1978). Dynamic programming solution of sequencing problems with precedence constraints. Operations Research, 26(3):444–449.

    Google Scholar 

  • T’Kindt, V. and Billaut, J.-C. (2006). Multicriteria Scheduling: Theory, Models and Algorithms. Springer, New York, second edition.

    Google Scholar 

  • Tseng, F. T., Stafford, Jr, E. F., and Gupta, J. N. D. (2004). An empirical analysis of integer programming formulations for the permutation flowshopn. OMEGA, The International Journal of Management Science, 32(4):285–293.

    Google Scholar 

  • Vallada, E. and Ruiz, R. (2010). Genetic algorithms for the unrelated parallel machine scheduling problem with sequence dependent setup times. European Journal of Operational Research. In review.

    Google Scholar 

  • Wagner, H. M. (1959). An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2):131–140.

    Google Scholar 

  • Wilson, J. M. (1989). Alternative formulations of a flowshopn scheduling problem. Journal of the Operational Research Society, 40(4):395–399.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento Organización Industrial y Gestión de Empresas, Universidad de Sevilla Escuela Superior de Ingenieros, Isla de la Cartuja, Sevilla, Spain

    Jose M. Framinan

  2. Fakultät für Ingenieurwissenschaften Allgemeine Betriebswirtschaftslehre und Operations Management, Universität Duisburg-Essen, Duisburg, Germany

    Rainer Leisten

  3. Grupo de Sistemas de Optimización Aplicada, Instituto Tecnológico de Informática, Universitat Politècnica de València, Valencia, Spain

    Rubén Ruiz García

Authors
  1. Jose M. Framinan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer Leisten
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rubén Ruiz García
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jose M. Framinan .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag London

About this chapter

Cite this chapter

Framinan, J.M., Leisten, R., Ruiz García, R. (2014). Exact Algorithms. In: Manufacturing Scheduling Systems. Springer, London. https://doi.org/10.1007/978-1-4471-6272-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-6272-8_8

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-6271-1

  • Online ISBN: 978-1-4471-6272-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation