Block multi-flow shop scheduling with complex buffers

DOI10.3969/J.ISSN.1006-7043.201308045MaRDI QIDQ5498150zbMATH OpenFDO

Authors Zhiying Zhang, Yijun Dai, Y. Sui

Publication date 11 February 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1006-7043.201308045

zbMATH Keywords

blocking timecompletion timecomplex buffersmulti-flow shop schedulingre-schedulingshipbuildingstructural heuristic algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 4076953
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• Flow-shop problems with intermediate buffers
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Optimizing blocking flow shop scheduling problem with total completion time criterion

Cited in

(2)

• MIP Formulations for Flowshop Scheduling with Limited Buffers
• Heuristics for flow shop rescheduling with mixed blocking constraints

This page was built for publication: Block multi-flow shop scheduling with complex buffers

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