Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation

DOI10.1007/978-3-642-34097-0_4zbMath1478.90041OpenAlexW173994594MaRDI QIDQ5023085

Aleksandr Skakovski, Piotr Jȩdrzejowicz

Publication date: 20 January 2022

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

Full work available at URL: https://doi.org/10.1007/978-3-642-34097-0_4

zbMATH Keywords

tabu searchrelative errorring topologytabu listproblem size

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization of computer simulation models with rare events
• On a methodology for discrete-continuous scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• Scheduling multiprocessor tasks in presence of correlated failures.
• A tutorial on the cross-entropy method
• Simulated annealing for multi-mode resource-constrained project scheduling