A note on makespan minimization in two-stage flexible flow shops with uniform machines

DOI10.1016/J.EJOR.2005.06.017MaRDI QIDQ2433488zbMATH OpenOpenAlexFDO

Authors George J. Kyparisis, C. Koulamas

Publication date 27 October 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.06.017

zbMATH Keywords

worst-case analysisflow shop schedulingflexible flow shopapproximation/heuristic

Mathematics Subject Classification ID

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

Recommendations

• Minimizing makespan in hybrid flowshops
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Flexible flow shop scheduling with uniform parallel machines
• A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines
• Two-stage proportionate flexible flow shop to minimize the makespan

Cites work

• scientific article; zbMATH DE number 776077 (Why is no real title available?)
• Bounds for List Schedules on Uniform Processors
• Minimizing makespan in hybrid flowshops
• Optimal two- and three-stage production schedules with set-up time included
• Scheduling algorithms for flexible flowshops: Worst and average case performance

Cited in

(4)

• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
• Two-stage proportionate flexible flow shop to minimize the makespan
• The hybrid flow shop scheduling problem

This page was built for publication: A note on makespan minimization in two-stage flexible flow shops with uniform machines

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