Abstract
For optimization problems that are NP-hard, which includes most problems arising in scheduling, there are at present no easy solutions. Classical OR-methods cannot be used, because you would need approximately 1036 years of time for a complete enumeration in our simplest test case, whereas an acceptable response time is about an quater of an hour. As there is currently no way to solve such problems exactly, the objective of finding the global optimum has to be changed in the target to find the best result possible over a given period.
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.
References
I. Althófer and K.-U. Koschnick (1991). On the Convergence of “Threshold Accepting”, Applied Mathematics and Optimization 24, pp. 183–195.
Committee on the Next Decade of Operations Research (Condor) (1988). Operations research: The next decade, Oper. Res. 36.
L. Davis (1985). “Job shop scheduling with Genetic Algorithms”, Pro-ceedings of the Internat. Conference on Genetic Algorithms and their Applications.
G. Dueck, T. Scheuer (1990). Threshold accepting: A general pur-pose optimization algorithm appearing superior to simulated annealing, Journal of Computational Physics 90, pp. 161–175.
J. Grefenstette, R. Gopal, B. Rosmaita, D. Van Gucht (1985). “Genetic Algorithms for the Travelling Salesman Problem”, Proceedings of the Internat. Conference on Genetic Algorithms and their Applications.
D.E. Goldberg (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, New York.
M. Gronalt, A. Nußbaumer, M. Schmid (1993). “Beschreibung des virtuellen Unternehmens - Entwicklung der Datenstruktur”, working paper.
J. Holland (1975). “Adaption in Natural and Artificial Systems”, The University of Michigan Press, Ann Arbor, Michigan.
W. Jammernegg, G. Feichtinger, H. Hruschka (1991). Projektbeschreibung: Entwicklung von Methoden zur dynamischen Ressourcenbelegungsplanung bei Flexiblen Montagesystemen.
S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi (1982). Optimization by simulated annealing, IBM Research Report RC 9355.
F.A. Ogbu, D.K. Smith (1990). “The application of the simulated annealing algorithm to the solution of the n/m/C nay flowshop problem”, Computs. Opus. Res. 17 (3), 243–253.
I.H. Osman, C.N. Potts (1989). “Simulated annealing for permutation flowshop scheduling”, OMEGA 17 (6), pp. 551–557.
M. Schmid (1993). “Kurzbeschreibung des Simulationsmodells zur Grobsimulation”, working paper.
Th. Taut (1992). Optimization Strategies for very complex job shop re-scheduling. Tabu Search - what else?, Diplomarbeit an der Techn. Universität München.
M. Widmer (1991). “Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach”, J. Opl. Res. Soc. 42 (1), 75–82.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Physica-Verlag Heidelberg
About this paper
Cite this paper
List, G., Nußbaumer, A. (1994). A Comparison of Heuristic Methods in Scheduling Flexible Assembly Systems. In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_81
Download citation
DOI: https://doi.org/10.1007/978-3-642-46955-8_81
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0794-3
Online ISBN: 978-3-642-46955-8
eBook Packages: Springer Book Archive