Abstract
The fifteen contributions to the first part of these proceedings provide an extensive survey of the area of deterministic and stochastic scheduling, and also review a few prominent interfaces between these two approaches.
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
J. Blazewicz, J.K. Lenstra, A.H.G. Rinnooy Kan (1980) Scheduling subject to resource constraints: classification and complexity. Report BW 127, Mathematisch Centrum Amsterdam; Discrete Appl. Math.,in process.
M.A.H. Dempster (ed.) (1980) Stochastic Programming, Academic Press, London.
W.H. Fleming, R.W. Rishel (1975) Deterministic and Stochastic Control. Springer, New York.
M.R. Garey, D.S. Johnson (1979) Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco
R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326.
R.M. Karp (1972) Reducibility among combinatorial problems. In: R.E. Miller, J.W. Thatcher (eds.) (1972) Complexity of Computer Computations, Plenum Press, New York, 85–103.
F.P. Kelly (1979) Reversibility and Stochastic Networks, Wiley, New York.
L. Kleinrock (1976) Queueing Systems, Vol. II: Computer Applications, Wiley, New York.
E.L. Lawler (1976) Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
E.L. Lawler, C.U. Martel (1980) Computing maximal “polymatroidal” network flows. Research Memorandum ERL M80/52, Electronics Research Laboratory, University of California, Berkeley; Math. Oper. Res., to appear.
R.D. Luce, H. Raiffa (1957) Games and Decisions, Wiley, New York.
J. Walrand, P. Varaiya (1978) The outputs of Jacksonian networks are Poissonian. Memorandum ERL M78/60, Electronics Research Laboratory, University of California, Berkeley.
R.R. Weber (1981) Scheduling jobs with stochastic processing requirements on parallel machines to minimize makespan or flowtime. J. Appl. Probab., to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 D. Reidel Publishing Company
About this paper
Cite this paper
Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (1982). Introduction. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_1
Download citation
DOI: https://doi.org/10.1007/978-94-009-7801-0_1
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7803-4
Online ISBN: 978-94-009-7801-0
eBook Packages: Springer Book Archive