Premium
On scheduling with ready‐times, due‐dates and vacations
Author(s) -
Leon V. Jorge,
Wu S. David
Publication year - 1992
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199202)39:1<53::aid-nav3220390105>3.0.co;2-c
Subject(s) - preemption , computer science , mathematical optimization , scheduling (production processes) , set (abstract data type) , job shop scheduling , due date , upper and lower bounds , relaxation (psychology) , algorithm , mathematics , schedule , psychology , mathematical analysis , social psychology , programming language , operating system
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.