New Solution Methods for Single Machine Bicriteria Scheduling Problems: Minimizing the Total Flowtim...
New Solution Methods for Single Machine Bicriteria Scheduling Problems: Minimizing the Total Flowtime and Maximum Tardiness with Zero Release Dates
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 maximum tardiness and total flowtime on single machine 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 tardiness and total flowtime, respectively if each criterion were...
Alternative Titles
Full title
New Solution Methods for Single Machine Bicriteria Scheduling Problems: Minimizing the Total Flowtime and Maximum Tardiness with Zero Release Dates
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2197382930
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2197382930
