Sciweavers

62 search results - page 7 / 13
» Intelligent Backtracking Techniques for Job Shop Scheduling
Sort
View
AAAI
1997
13 years 8 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 8 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
ICTAI
1994
IEEE
13 years 10 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
AIPS
2009
13 years 7 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...
ECAIW
2000
Springer
13 years 11 months ago
Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling
When searching the space of possible plans for combined planning and scheduling problems we often reach a local maximum and must either backtrack or otherwise modify the plan to m...
Russell Knight, Gregg Rabideau, Steve A. Chien