Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling w...
Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates
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
This study investigates the unrelated parallel machine scheduling problem with release dates to minimise the makespan. The solution to this problem finds wide applications in manufacturing and logistics systems. Due to the strong NP-hardness of the problem, most researchers develop heuristics, and the largest instances they consider are limited to...
Alternative Titles
Full title
Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1080_00207543_2021_1983224
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1080_00207543_2021_1983224
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2021.1983224
