Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

ECAI
2004
Springer

favoriteEmaildiscussreport

91views Artificial Intelligence» more ECAI 2004»

Job Shop Scheduling with Probabilistic Durations

14 years 4 months ago

Job Shop Scheduling with Probabilistic Durations

Download tidel.mie.utoronto.ca

Abstract. Proactive approaches to scheduling take into account information about the execution time uncertainty in forming a schedule. In this paper, we investigate proactive approaches for the job shop scheduling problem where activity durations are random vari

J. Christopher Beck, Nic Wilson

Real-time Traffic

Artificial Intelligence | ECAI 2004 | Execution Time Uncertainty | Proactive Approaches | Shop Scheduling Problem |

claim paper

Related Content

» Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations

» A New Local Search for the Job Shop Problem with Uncertain Durations

» A Fluid Heuristic for Minimizing Makespan in Job Shops

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ECAI
Authors	J. Christopher Beck, Nic Wilson

Comments (0)