Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
This paper addresses the mixed no-idle flowshop scheduling problem with flowtime minimization. In a mixed no-idle environment, machines are set in series and some machines do not allow idleness and require continuous processing. We approached a variant of this problem that analyses the total flowtime minimization criterion. As this is a new problem...
Alternative Titles
Full title
Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2726143269
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2726143269
Other Identifiers
ISSN
0171-6468
E-ISSN
1436-6304
DOI
10.1007/s00291-022-00678-9
