Minimization of Total Tardiness and Total Flowtime on Single Machine with Non-Zero Release Dates
Minimization of Total Tardiness and Total Flowtime on Single Machine with Non-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 composite function of total tardiness and total flow time on single machine with non-zero release dates. The problem is strongly Non Polynomial (NP). Thus, two heuristics SA7 and SA8 were proposed to solve the problem. The generalized algorithm and the branch and bound procedu...
Alternative Titles
Full title
Minimization of Total Tardiness and Total Flowtime on Single Machine with Non-Zero Release Dates
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1875942899
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1875942899
