Bounding strategies for the hybrid flow shop scheduling problem
From MaRDI portal
Publication:545969
DOI10.1016/J.AMC.2011.02.108zbMATH Open1231.90197OpenAlexW2127154245MaRDI QIDQ545969FDOQ545969
Authors: Lotfi Hidri, Mohamed Haouari 
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
Recommendations
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- Minimizing makespan in hybrid flowshops
- Multiple-machine lower bounds for shop-scheduling problems
- A new lower bounding rule for permutation flow shop scheduling
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- The hybrid flow shop scheduling problem
- Global lower bounds for flow shops with multiple processors
- Scheduling with limited machine availability
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Title not available (Why is that?)
- Energetic reasoning revisited: Application to parallel machine scheduling
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Title not available (Why is that?)
- Minimizing makespan on parallel machines subject to release dates and delivery times
- Scheduling jobs with release dates and tails on identical machines to minimize the makespan
- Optimal parallel machines scheduling with availability constraints
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
Cited In (11)
- Aggregate planning in hybrid flowshops
- Automatic algorithm design for hybrid flowshop scheduling problems
- Multiple-machine lower bounds for shop-scheduling problems
- Machine scheduling in underground mining: an application in the potash industry
- Branch and bound crossed with GA to solve hybrid flowshops
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
- The hybrid flow shop scheduling problem
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
This page was built for publication: Bounding strategies for the hybrid flow shop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545969)
