Bicriteria scheduling for minimizing flow time and maximum tardiness

Bicriteria scheduling for minimizing flow time and maximum tardiness

0.00 Avg rating0 Votes
Article ID: iaor1997558
Country: United States
Volume: 43
Issue: 6
Start Page Number: 929
End Page Number: 936
Publication Date: Sep 1996
Journal: Naval Research Logistics
Authors: , ,
Abstract:

The authors consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. They develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules.

Reviews

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