Complexity of single machine, multi-criteria scheduling problems

Complexity of single machine, multi-criteria scheduling problems

0.00 Avg rating0 Votes
Article ID: iaor199778
Country: Netherlands
Volume: 70
Issue: 1
Start Page Number: 115
End Page Number: 125
Publication Date: Oct 1993
Journal: European Journal of Operational Research
Authors: ,
Abstract:

The authors examine the complexity of scheduling problems when more than one measure of performance is appropriate. The criteria they study are maximal tardiness, flowtime, number of tardy jobs, tardiness and the weighted counterparts of the last three measures. The machine environment is restricted to a single machine. Complexity results are given for secondary criterion, bicriteria and weighted criteria approaches for all combinations of measures. Of the problems examined, only six remain open.

Reviews

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