Scheduling with earliest start and due date constraints on multiple machines

Paul Bratley, Michael Florian and Pierre Robillard

Naval Research Logistics Quarterly, 1975, vol. 22, issue 1, 165-173

Abstract: We consider the scheduling of n jobs on m identical machines when the jobs become available for processing at ready times ai, ai, ⩾ 0, require di time units for processing and must be completed by times bi for i = 1, 2, … n. The objective chosen is that of minimizing the total elapsed time to complete all jobs subject to the ready time and due date constraints, preemption is not allowed. We present a multi‐stage solution algorithm for this problem that is based on an implicit enumeration procedure and also uses the labelling type algorithm which solves the problem when preemption is allowed.

Date: 1975
References: Add references at CitEc
Citations:

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

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:22:y:1975:i:1:p:165-173

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 ().