An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

0.00 Avg rating—0 Votes
Article ID: iaor2004180
Country: Netherlands
Volume: 31
Issue: 1
Start Page Number: 49
End Page Number: 52
Publication Date: Jan 2003
Journal: Operations Research Letters
Authors: ,
Abstract:

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.

Reviews

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