scientific article; zbMATH DE number 6719013

DOI10.11990/JHEU.201601002MaRDI QIDQ2984145zbMATH OpenFDO

Authors Yunyun Chen, Zhiying Zhang

Publication date 17 May 2017

Full work available at URL https://doi.org/10.11990/JHEU.201601002

zbMATH Keywords

clustering algorithmheuristic algorithmoptimization algorithmpainting operationreentrant schedulingspatial constrainttime constraint

Mathematics Subject Classification ID

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

Recommendations

• Efficient methods to schedule re-entrant flowshop system
• scientific article; zbMATH DE number 7267489
• Reoptimization of the minimum total flow-time scheduling problem
• Reoptimization in machine scheduling
• Optimizing blocking flow shop scheduling problem with total completion time criterion
• scientific article; zbMATH DE number 6001874
• Aggregation heuristic for the open-pit block scheduling problem
• A review of re-entrant scheduling problems
• Minimizing total completion time for re-entrant flow shop scheduling problems

This page was built for publication:

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