A hybrid cooperative co-evolution algorithm with a Petri-net-based deadlock amendment method is proposed for distributed assembly flowshop scheduling with limited buffers.
An effective discrete monarch butterfly optimization algorithm for distributed blocking flow shop scheduling with an assembly machine,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Hybrid Cooperative Co-Evolution Algorithm for Deadlock-prone Distributed Assembly Flowshop Scheduling with Limited buffers Using Petri nets
A hybrid cooperative co-evolution algorithm with a Petri-net-based deadlock amendment method is proposed for distributed assembly flowshop scheduling with limited buffers.