4 search results - page 1 / 1 » Job Shop Scheduling with Probabilistic Durations |
ECAI
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule. In this paper, we investigate proactive appro...
JAIR
2007
13 years 7 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 ...
AIPS
2008
13 years 9 months ago
2008
In the sequel we consider the job shop scheduling problem with uncertain durations represented as triangular fuzzy numbers. We propose a new neighbourhood structure for local sear...
IOR
2002
13 years 7 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...