This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
3.4 Bibliographical Notes
Davis, J.S., and J.J. Kanet [1993], Single-machine scheduling with early and tardy completion costs, Naval Research Logistics 40, 85–101.
Garey, M.R., and D.S. Johnson [1979], Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company.
Garey, M.R., D.S. Johnson, and R. Sethi [1976], The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research 1, 117–129.
Gonzalez, T., and S. Sahni [1978], Flowshop and jobshop schedules: Complexity and approximation, Operations Research 26, 36–52.
Garey, M.R., R.E. Tarjan, and G.T. Wilfong [1988], One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13, 330–348.
Lenstra, J.K., A.H.G. Rinnooy Kan, and P. Brucker [1977], Complexity of machine scheduling problems, Annals of Discrete Mathematics 1, 343–362.
Roy, B., and B. Sussmann [1964], Les Problèmes d’ordonnancement avec contraintes disjonctives, Technical Report Note DS No. 9 bis, SEMA, Montrouge, France.
Smith, W.E. [1956], Various optimizers for single-stage production, Naval Research Logistics Quarterly 3, 59–66.
Laarhoven, P.J.M. van [1988], Theoretical and Computational Aspects of Simulated Annealing, Ph.D. thesis, Eindhoven University of Technology, The Netherlands.
Laarhoven, P.J.M. van, E.H.L. Aarts, and J.K. Lenstra [1992], Job shop scheduling by simulated annealing, Operations Research 40, 113–125.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Indirect Solution Representations. In: Theoretical Aspects of Local Search. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-35854-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-35854-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35853-4
Online ISBN: 978-3-540-35854-1
eBook Packages: Computer ScienceComputer Science (R0)