Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints

DOI10.15960/J.CNKI.ISSN.1007-6093.2018.04.002MaRDI QIDQ5197293zbMATH OpenFDO

Authors Shuang Cai, Ke Yang, Ke Liu

Publication date 20 September 2019

zbMATH Keywords

heuristic algorithmbranch-and-bound methodmathematic programmingdistributed permutation flow shop schedulingmachine eligibility constraints

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• The distributed permutation flowshop scheduling problem
• Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
• A scatter search algorithm for the distributed permutation flowshop scheduling problem

Cited in

(9)

• Just-in-time scheduling for a distributed concrete precast flow shop system
• Survey on optimization algorithms for distributed shop scheduling
• Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop
• Multi-objective optimization of the distributed permutation flow shop scheduling problem with transportation and eligibility constraints
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem

This page was built for publication: Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197293)