Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage

DOI10.1057/JORS.1995.28zbMath0827.90070OpenAlexW2077522094MaRDI QIDQ4834245

Bo Chen

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

zbMATH Keywords

heuristicsparallel machinesworst-case performanceminimum makespantwo-stage flow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (33)

Optimizing resource speed for two-stage real-time tasks ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Scheduling manufacturing systems for delayed product differentiation in agile manufacturing ⋮ An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ A new three-machine shop scheduling: complexity and approximation algorithm ⋮ Flowshop scheduling with interstage job transportation ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. ⋮ Approximation algorithms for the parallel flow shop problem ⋮ Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ Hybrid flow-shop scheduling problems with multiprocessor task systems. ⋮ Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations ⋮ A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan ⋮ A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines ⋮ Hybrid flowshop scheduling with interstage job transportation ⋮ An FPTAS for the parallel two-stage flowshop problem ⋮ A two-stage hybrid flowshop with uniform machines and setup times ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ 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 ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Scheduling of a single crane in batch annealing process ⋮ 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 ⋮ A hybrid two-stage flowshop with part family, batch production, major and minor set-ups ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops ⋮ Modelling multi-stage manufacturing systems for efficient scheduling ⋮ Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints ⋮ The flow shop with parallel machines: A tabu search approach ⋮ Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

This page was built for publication: Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage