On scheduling with ready‐times, due‐dates and vacations

V. Jorge Leon and S. David Wu

Naval Research Logistics (NRL), 1992, vol. 39, issue 1, 53-65

Abstract: A single machine sequencing problem is considered in which there are ready‐time and due‐date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intriguing feature of this formulation is that it allows sequencing in disconnected time windows. A relaxation of the problem is obtained by modeling the vacations as a set of jobs with flexible ready‐times and artificial due‐dates and a branch and bound algorithm is developed for the problem. In the algorithm, the search is not only guided by the bounds but also by a careful manipulation of the artificial due‐dates. Consequently; while searching in the relaxed solution space, solutions of the original problem are implicitly enumerated. Computational results indicate that the algorithm can satisfactorily solve problems with multiple vacations.

Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199202)39:13.0.CO;2-C

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:navres:v:39:y:1992:i:1:p:53-65

Access Statistics for this article

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