Evolutionary scheduling: A review

E Hart, P Ross, D Corne - Genetic Programming and Evolvable Machines, 2005 - Springer
Early and seminal work which applied evolutionary computing methods to scheduling
problems from 1985 onwards laid a strong and exciting foundation for the work which has …

A genetic algorithm for energy-efficiency in job-shop scheduling

MA Salido, J Escamilla, A Giret, F Barber - The International Journal of …, 2016 - Springer
Many real-world scheduling problems are solved to obtain optimal solutions in term of
processing time, cost, and quality as optimization objectives. Currently, energy-efficiency is …

Natural Computing Series

TBAEEJN Kok, HP Spaink, CGTHL Kari, LLT Martinetz… - 2006 - Springer
Untitled Page 1 Page 2 Natural Computing Series Series Editors: G. Rozenberg Th.Bäck AEEiben
JNKok HPSpaink Leiden Center for Natural Computing AdvisoryBoard: S.Amari G.Brassard …

Complexity theory and the no free lunch theorem

D Whitley, JP Watson - … : Introductory tutorials in optimization and decision …, 2005 - Springer
This tutorial reviews basic concepts in complexity theory, as well as various No Free Lunch
results and how these results relate to computational complexity. The tutorial explains basic …

[PDF][PDF] A comparison of techniques for scheduling earth observing satellites

A Globus, J Crawford, J Lohn, A Pryor - AAAI, 2004 - cdn.aaai.org
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves
large search spaces, complex constraints and poorly understood bottlenecks; conditions …

[PDF][PDF] Slack-based techniques for robust schedules

A Davenport, C Gefflot, C Beck - Sixth European conference on …, 2014 - cdn.aaai.org
Many scheduling systems assume a static environment within which a schedule will be
executed. The real world is not so stable: machines break down, operations take longer to …

The impact of incentive-based programmes on job-shop scheduling with variable machine speeds

M Füchtenhans, CH Glock - International Journal of Production …, 2024 - Taylor & Francis
Given the high demand for energy in the manufacturing industry and the increasing use of
renewable but volatile energy sources, it becomes increasingly important to coordinate …

Contrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance

JP Watson, L Barbulescu… - INFORMS Journal on …, 2002 - pubsonline.informs.org
The use of random test problems to evaluate algorithm performance raises an important,
and generally unanswered, question: Are the results generalizable to more realistic …

Super solutions in constraint programming

E Hebrard, B Hnich, T Walsh - … on integration of artificial intelligence (AI) …, 2004 - Springer
To improve solution robustness, we introduce the concept of super solutions to constraint
programming. An (a, b)-super solution is one in which if a variables lose their values, the …

When and why metaheuristics researchers can ignore “No Free Lunch” theorems

J McDermott - SN Computer Science, 2020 - Springer
Abstract The No Free Lunch (NFL) theorem for search and optimisation states that averaged
across all possible objective functions on a fixed search space, all search algorithms …