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
References
Dessouky, M.I., Lageweg, B.J., Lenstra, J.K., and Van de Velde, S.L.: ‘Scheduling identical jobs on uniform parallel machines’, Statistica Neerlandica 44 (1990), 115–123.
Garey, M.R., Johnson, D.S., Tarjan, R.E., and Yan-Nakakis, M.: ‘Scheduling opposing forests’, SIAMJ. Algebra Discrete Math. 4 (1983), 72–93.
Hu, T.C.: ‘Parallel sequencing and assembly line problems’, Oper. Res. 9 (1961), 841–848.
Lawler, E.L.: ‘Sequencing to minimize the weighted number of tardy jobs’, Revue Française d’Automatique Informatique: Recherche Operationnelle S10 (1976), 27–33.
Timkovsky, V.G.: ‘Identical parallel machines vs. unit-time shops, preemptions vs. chains, and other offsets in scheduling complexity’, Unpublished manuscript (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Kluwer Academic Publishers and Elliott H. Lieb for “Lieb-Thirring inequalities” and “Thomas-Fermi theory”
About this chapter
Cite this chapter
Hazewinkel, M. (2000). U. In: Hazewinkel, M. (eds) Encyclopaedia of Mathematics. Encyclopaedia of Mathematics. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-1279-4_21
Download citation
DOI: https://doi.org/10.1007/978-94-015-1279-4_21
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5378-7
Online ISBN: 978-94-015-1279-4
eBook Packages: Springer Book Archive