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

DOI10.1016/J.EJOR.2005.06.017zbMATH Open1142.90404OpenAlexW2001435223MaRDI QIDQ2433488FDOQ2433488

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

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

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)

Cites Work

• Optimal two- and three-stage production schedules with set-up time included
• Bounds for List Schedules on Uniform Processors
• Minimizing makespan in hybrid flowshops
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Title not available (Why is that?)

Cited In (4)

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

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)