Abstract
We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time a i , must be completed by time b i , and requires d i time units for processing. The aim is to find a schedule that minimizes the elapsed time to complete all jobs. We present solution algorithms for this problem when job splitting is permitted and when job splitting is not permitted. Then we consider several scheduling situations which arise in practice where these models may apply.
To appear in NRLQ, Vol. 18, vo. 4.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Bratley, P., Florian, M., Robillard, P. (1973). Scheduling with Earliest Start and Due Date Constraints. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive