Abstract
We examine the complexity of scheduling problems when more than one measure of performance is appropriate. The criteria we 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
