Hybrid flow-shop with adjustment

MaRDI QIDQ3085447zbMATH OpenFDO

Authors

Publication date 31 March 2011

Full work available at URL https://eudml.org/doc/196675, http://www.kybernetika.cz/content/2011/1/50

zbMATH Keywords

heuristicsinteger programmingcase studyflow-shop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Two-Stage, Hybrid Flowshop Scheduling Problem
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• Optimal scheduling of a two-stage hybrid flow shop

Cites work

• scientific article; zbMATH DE number 1128827 (Why is no real title available?)
• Complexity of Scheduling under Precedence Constraints
• Planning Machine Maintenance in Two-Machine Shop Scheduling
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops

This page was built for publication: Hybrid flow-shop with adjustment

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