An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling proble...
An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
About this item
Full title
Author / Creator
Publisher
London: Taylor & Francis
Journal title
Language
English
Formats
Publication information
Publisher
London: Taylor & Francis
Subjects
More information
Scope and Contents
Contents
The single machine total weighted tardiness problem with sequence-dependent setup times (often known as problem
) requires a given set of jobs to be sequenced on a single machine, where a setup time is required before the processing of each job that depends on both the preceding job and the job to be processed next. The goal is to minimise the s...
Alternative Titles
Full title
An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1509845911
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1509845911
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2014.883472
