Preview
Unable to display preview. Download preview PDF.
References
Adams, J.; Balas, E.; Zawack, D.: The shifting bottleneck procedure for job shop scheduling, Manage.Sci., Vol. 34, 1988, No. 3, 391–401.
Bräsel, H.: Rangminimale Maschinenbelegungsprobleme, Wissen. Z. Tech. Univ. Otto von Guericke 31, 1987, Heft 5.
Carlier, J.: The one-machine sequencing problem, Eur. J. Oper. Res. 11, 1982, 42–47.
Grabowski, J.: A new algorithm of solving the flow-shop problem, in: Feichtinger, G.; Kall, P. (eds.): Operations Research in Progress, Reidel Publishing Company, 1982, 57–75.
Lenstra, J.K.: Sequencing by Enumerative Methods, Mathematical Centre Tracts, 1977.
Rinnooy Kan, A.H.G.: Machine Scheduling Problems, Martinus Nijhoff The Hague, 1976.
Spachis, A.S.; King, J.R.: Job-shop scheduling heuristics with local neighbourhood search, Int. J. of Prod. Res., Vol. 17, 1979, No. 6, 507–526.
Werner, F.: Zur Struktur und näherungsweisen Lösung ausgewählter kombinatorischer Optimierungsprobleme, Dissertation B, TU Magdeburg, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 International Federation for Information Processing
About this paper
Cite this paper
Bräsel, H., Werner, F. (1990). The job - shop problem - modelling by latin rectangles, exact and heuristic solution. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008398
Download citation
DOI: https://doi.org/10.1007/BFb0008398
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52659-9
Online ISBN: 978-3-540-47095-3
eBook Packages: Springer Book Archive