Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
DOI10.1007/978-3-642-21311-3_12zbMATH Open1302.90085OpenAlexW1573870118MaRDI QIDQ3003281FDOQ3003281
Mohamed Haouari, Asma Lahimer, Pierre Lopez
Publication date: 26 May 2011
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_12
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Recommendations
- Bounding strategies for the hybrid flow shop scheduling problem 👍 👎
- An iterated greedy heuristic for multistage hybrid flowshop scheduling problems with multiprocessor tasks 👍 👎
- Local search algorithms for the multiprocessor flow shop scheduling problem 👍 👎
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks 👍 👎
- Hybrid flow-shop scheduling problems with multiprocessor task systems. 👍 👎
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds 👍 👎
- Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic 👍 👎
- Climbing discrepancy search for flowshop and jobshop scheduling with time lags 👍 👎
This page was built for publication: Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003281)
