Scheduling tasks with sequence-dependent processing times

Scheduling tasks with sequence-dependent processing times

0.00 Avg rating0 Votes
Article ID: iaor1988523
Country: United States
Volume: 35
Issue: 2
Start Page Number: 177
End Page Number: 184
Publication Date: Apr 1988
Journal: Naval Research Logistics
Authors: , , ,
Abstract:

In this article the authors consider the problem of minimizing the maximum completion time of a sequence of n jobs on a single machine. Nonzero ready times and sequence-dependent processing times are allowed. Upper bounds, lower bounds, and dominance criteria are proposed and exploited in a branch-and-bound algorithm. Computational results are given.

Reviews

Required fields are marked *. Your email address will not be published.