Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1613/jair.2080

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 represented by an independent random variable with a known mean and variance. The best solutions are ones which have a high probability of achieving a good makespan. We first create a theoretical framework, formally showing how Monte Carlo simulation can be combined with deterministic scheduling algorithms to solve this problem. We propose an associated deterministic scheduling problem whose solution is proved, under certain conditions, to be a lower bound for the probabilistic problem. We then propose and investigate a number of techniques for solving such problems based on combinations of Monte Carlo simulation, solutions to the associated deterministic problem, and either constraint programming or tabu search. Our empirical results demonstrate that a combination of the use of the associated deterministic problem and Monte Carlo simulation results in algorithms that scale best both in terms of problem size and uncertainty. Further experiments point to the correlation between the quality of the deterministic solution and the quality of the probabilistic solution as a major factor responsible for this success.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-634469

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.