Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
From MaRDI portal
Publication:4834245
DOI10.1057/jors.1995.28zbMath0827.90070MaRDI QIDQ4834245
Publication date: 28 May 1995
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1995.28
heuristics; parallel machines; worst-case performance; minimum makespan; two-stage flow shop scheduling
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling manufacturing systems for delayed product differentiation in agile manufacturing, A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately, Preemptive hybrid flowshop scheduling problem of interval orders, Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, A hybrid two-stage flowshop with part family, batch production, major and minor set-ups, Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., Hybrid flow-shop scheduling problems with multiprocessor task systems., A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem, Heuristics for the two-stage job shop scheduling problem with a bottleneck machine, Modelling multi-stage manufacturing systems for efficient scheduling, The flow shop with parallel machines: A tabu search approach, Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling, A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines, Scheduling two-stage hybrid flow shop with availability constraints
