Pixelation of time matrices for solving permutation flowshop scheduling problem
Pixelation of time matrices for solving permutation flowshop scheduling problem
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
Over the last decades, scheduling theory has been put into practice so as to tackle production process as a combinatorial optimisation problem and specifically as a PFSP (Permutation Flowshop Scheduling Problem). Often, NP-completeness of PFSP leads numerous research towards suggesting heuristic algorithms. The objective is to propose an optimal or...
Alternative Titles
Full title
Pixelation of time matrices for solving permutation flowshop scheduling problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_3125409192
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_3125409192
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207543.2024.2344654
