Scheduling with earliest start and due date constraints

Paul Bratley, Michael Florian and Pierre Robillard

Naval Research Logistics Quarterly, 1971, vol. 18, issue 4, 511-519

Abstract: We consider the scheduling of n tasks on a single resource. Each task becomes available for processing at time ai, must be completed by time bi, and requires di 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.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800180410

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:18:y:1971:i:4:p:511-519

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().