Minimizing makespan in hybrid flowshops

DOI10.1016/0167-6377(94)90026-4zbMath0812.90066OpenAlexW2022864263MaRDI QIDQ1342286

Chung-Yee Lee, George L. Vairaktarakis

Publication date: 15 May 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90026-4

zbMATH Keywords

error boundmakespanmultiple stageshybrid flowshop\({\mathcal N}{\mathcal P}\)-completemultiple machines

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling flexible flow lines with sequence-dependent setup times, Optimal versus heuristic scheduling of surface mount technology lines, A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines, Unnamed Item, 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 two-stage hybrid flow shop with dedicated machines at the first stage, Optimal scheduling of a two-stage hybrid flow shop, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, A taxonomy of flexible flow line scheduling procedures, Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach, Heuristic algorithms for the two-stage hybrid flowshop problem, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines, Minimizing total completion time in two-stage hybrid flow shop with dedicated machines, Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop., An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions, Approximation algorithms for the parallel flow shop problem, Two-stage proportionate flexible flow shop to minimize the makespan, An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers., Hybrid flow-shop scheduling problems with multiprocessor task systems., A note on makespan minimization in two-stage flexible flow shops with uniform machines, Unnamed Item, A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan, Scheduling problems in master-slave model, Modeling realistic hybrid flexible flowshop scheduling problems, An FPTAS for the parallel two-stage flowshop problem, Heuristics for periodical batch job scheduling in a MapReduce computing framework, Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage, On the optimality conditions of the two-machine flow shop problem, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, A review of exact solution methods for the non-preemptive multiprocessor flowshop problem, 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, Improved approximation algorithms for two-stage flexible flow shop scheduling, Flow shops with reentry: reversibility properties and makespan optimal schedules, An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop, Scheduling hybrid flowshop with parallel batching machines and compatibilities, Minimizing makespan in two-stage hybrid cross docking scheduling problem, Approximation algorithms for two-stage flexible flow shop scheduling, Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint, Sequencing a hybrid two-stage flowshop with dedicated machines, 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, The master-slave paradigm in parallel computer and industrial settings, A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops, Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines, Two-machine flowshop scheduling with availability constraints, Flexible flow shop scheduling with uniform parallel machines, Flowshop scheduling with identical jobs and uniform parallel machines, Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage

Cites Work

• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• A state-of-the-art review of parallel-machine scheduling research
• Some no-wait shops scheduling problems: Complexity aspect
• Routing flexibility and production scheduling in a flexible manufacturing system
• Optimal two- and three-stage production schedules with setup times included
• A loading and dispatching problem in a random flexible manufacturing system
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies