Efficient Heuristics for Total Completion Time and Maximum Lateness Bicriteria Scheduling Problems
Efficient Heuristics for Total Completion Time and Maximum Lateness Bicriteria Scheduling Problems
Efficient Heuristics for Total Completion Time and Maximum Lateness Bicriteria Scheduling Problems
About this item
Full title
Author / Creator
Publisher
Zurich: Trans Tech Publications Ltd
Journal title
Language
English
Formats
Publication information
Publisher
Zurich: Trans Tech Publications Ltd
Subjects
More information
Scope and Contents
Contents
This paper considers the bicriteria scheduling problem of minimizing the total completion time and maximum lateness with zero release dates. The problem is NP hard, though Early Due Date (EDD) and Shortest Processing Time (SPT) rules yielded optimal solutions for maximum lateness and total completion time, respectively if each criterion were to be...
Alternative Titles
Full title
Efficient Heuristics for Total Completion Time and Maximum Lateness Bicriteria Scheduling Problems
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2359625500
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2359625500
Other Identifiers
ISBN
9783035714180,3035714185
ISSN
2234-9898,2234-991X
E-ISSN
2234-991X
DOI
10.4028/www.scientific.net/AEF.35.110
