On scheduling with readytimes, duedates and vacations
Academic Article
Overview
Research
Identity
Additional Document Info
Other
View All
Overview
abstract
A single machine sequencing problem is considered in which there are readytime and duedate 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 readytimes and artificial duedates 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 duedates. 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. Copyright 1992 Wiley Periodicals, Inc., A Wiley Company