Branch and bound crossed with GA to solve hybrid flowshops

DOI10.1016/S0377-2217(97)00333-0zbMath0943.90038OpenAlexW2142087645MaRDI QIDQ1296101

D. Dezalay, A. Vignier, D. Dardilhac, Marie-Claude Portmann

Publication date: 10 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00333-0

zbMATH Keywords

branch-and-bound algorithmheuristicsgenetic algorithmhybrid flowshop schedulinginitial upper bound

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Using genetic algorithm for dynamic and multiple criteria web-site optimizations ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines ⋮ 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 ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Steel-making process scheduling using Lagrangian relaxation ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

Cites Work

• Branch and bound algorithm for the flow shop with multiple processors
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Two-Stage, Hybrid Flowshop Scheduling Problem