Bounding strategies for the hybrid flow shop scheduling problem
From MaRDI portal
Publication:545969
DOI10.1016/j.amc.2011.02.108zbMath1231.90197OpenAlexW2127154245MaRDI QIDQ545969
Publication date: 24 June 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.108
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Machine scheduling in underground mining: an application in the potash industry ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ Automatic algorithm design for hybrid flowshop scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Energetic reasoning revisited: Application to parallel machine scheduling
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Global lower bounds for flow shops with multiple processors
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Minimizing makespan on parallel machines subject to release dates and delivery times
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Optimal parallel machines scheduling with availability constraints
- Scheduling with limited machine availability
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- An Exact Method for Solving the Multi-Processor Flow-Shop
