Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems

DOI10.1007/978-3-642-29694-9_22zbMath1277.68249OpenAlexW2231415567MaRDI QIDQ2866131

R. Badlishah Ahmad, Y. Laalaoui

Publication date: 13 December 2013

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_22

zbMATH Keywords

meta-heuristicshalting problemsteady-statedecision scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• Job shop scheduling with deadlines
• Scheduling unit-time tasks with integer release times and deadlines
• Real-time heuristic search
• Tabu Search—Part I
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

This page was built for publication: Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems