Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search

DOI10.1007/s10852-008-9101-1zbMath1184.68127OpenAlexW2028781468MaRDI QIDQ846170

Antoine Jouglet, Marc Sevaux, Oguz, Ceyda

Publication date: 1 February 2010

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9101-1

zbMATH Keywords

genetic algorithmmemetic algorithmconstraint programmingmultiprocessor task schedulinghybrid flow-shop

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

Uses Software

• ILOG SCHEDULE

Cites Work

• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• A computational study of constraint satisfaction for multiple capacitated job shop scheduling
• Branch and bound crossed with GA to solve hybrid flowshops
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Accelerating filtering techniques for numeric CSPs
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Two-Stage, Hybrid Flowshop Scheduling Problem
• A Gentle Introduction to Memetic Algorithms
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• An Exact Method for Solving the Multi-Processor Flow-Shop
• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item