Sciweavers

62 search results - page 1 / 13
» Intelligent Backtracking Techniques for Job Shop Scheduling
Sort
View
KR
1992
Springer
13 years 8 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
ECAI
1994
Springer
13 years 8 months ago
Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
W. P. M. Nuijten, Emile H. L. Aarts
JAIR
2007
106views more  JAIR 2007»
13 years 4 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
AIPS
2003
13 years 6 months ago
Vehicle Routing and Job Shop Scheduling: What's the Difference?
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
J. Christopher Beck, Patrick Prosser, Evgeny Selen...
AIPS
2006
13 years 6 months ago
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Multi-point constructive search (MPCS) performs a series of resource-limited backtracking searches where each search begins either from an empty solution (as in randomized restart...
J. Christopher Beck