Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable proce...
Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times
About this item
Full title
Author / Creator
Publisher
Abingdon: Taylor & Francis Group
Journal title
Language
English
Formats
Publication information
Publisher
Abingdon: Taylor & Francis Group
Subjects
More information
Scope and Contents
Contents
The job-shop scheduling problem with discretely controllable processing times (JSP-DCPT) is a combination of two kinds of sub-problems: the job-shop scheduling problem and the discrete time-cost tradeoff problem. Neither good approximation algorithms nor efficient exact algorithms exist for the bicriteria JSP-DCPT that is to simultaneously minimise...
Alternative Titles
Full title
Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_1080_00207543_2011_651169
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_1080_00207543_2011_651169
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2011.651169
