Sciweavers

62 search results - page 9 / 13
» A steady-state evolutionary algorithm for the job shop probl...
Sort
View
AIPS
2009
13 years 8 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
14 years 1 months ago
Toward a better understanding of rule initialisation and deletion
A number of heuristics have been used in Learning Classifier Systems to initialise parameters of new rules, to adjust fitness of parent rules when they generate offspring, and ...
Tim Kovacs, Larry Bull
CEC
2007
IEEE
14 years 1 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins
ICTAI
1994
IEEE
13 years 11 months ago
A Distributed Scheduling Framework
A distributed problem solving approach to job shop scheduling is described in this paper. The approach views the system as an Organisation. Agents are assigned di erent roles and ...
Carla P. Gomes, Austin Tate, Lyn Thomas
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 2 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...