62 search results - page 6 / 13 » Intelligent Backtracking Techniques for Job Shop Scheduling |
AAAI
1994
13 years 8 months ago
1994
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
CAV
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
ESA
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
JAIR
2007
13 years 6 months ago
2007
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be ...
EVOW
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...