Bounding strategies for the hybrid flow shop scheduling problem

DOI10.1016/J.AMC.2011.02.108MaRDI QIDQ545969zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicslower boundsschedulinghybrid flow shop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• An Exact Method for Solving the Multi-Processor Flow-Shop
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• Energetic reasoning revisited: Application to parallel machine scheduling
• Global lower bounds for flow shops with multiple processors
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Optimal parallel machines scheduling with availability constraints
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Scheduling with limited machine availability
• The hybrid flow shop scheduling problem
• Two-Stage, Hybrid Flowshop Scheduling Problem

Cited in

(12)

• 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
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Branch and bound crossed with GA to solve hybrid flowshops
• 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
• Decomposition heuristics for the hybrid flexible flowshop with transportation times
• 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)