Job shop scheduling with probabilistic durations

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 652-656

  Beck, J Christopher ^a   Wilson, Nic ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

MONTE CARLO METHODS;

ACTIVITY DURATION; JOB SHOP SCHEDULING PROBLEMS; JOB-SHOP SCHEDULING; LOW BOUND; MAKESPAN; PRO-ACTIVE APPROACH; PROBABILISTIC DURATION; PROBABILISTICS; SCHEDULING PROBLEM; TIME UNCERTAINTY;

JOB SHOP SCHEDULING;

EID: 85017349838     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. J. C. Beck and M. S. Fox, Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics, Artificial Intelligence, 117(1), 31-81, (2000).
2. J. M. Burt and M. B. Garman, Monte carlo techniques for stochastic network analysis, in Proceedings of the fourth annual conference on applications of simulation, pp. 146-153, (1970).
3. R.L. Daniels and J.E. Carrillo, β-robust scheduling for single-machine systems with uncertain processing times, IIE Transactions, 29, 977-985, (1997).
4. A.J. Davenport, C. Geffot, and J.C. Beck, Slack-based techniques for robust schedules, in Proceedings of the Sixth European Conference on Planning (ECP-2001), (2001).
5. H-L. Fang, Genetic Algorithms in Timetabling and Scheduling, Ph.D. dissertation, Department of Artificial Intelligence, University of Edinburgh, 1994.
6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
7. J. N. Hagstrom, Computational complexity of PERT problems, Networks, 18, 139-147, (1988).
8. P. Laborie, Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results, Artificial Intelligence, 143, 151-88, (January 2003).
9. C. Le Pape, P. Couronńe, D. Vergamini, and V. Gosselin, Timeversus- capacity compromises in project scheduling, in Proceedings of the Thirteenth Workshop of the UK Planning Special Interest Group, (1994).
10. A. Ludwig, R.H. Mohring, and F. Stork, A computational study on bounding the makespan distribution in stochastic project networks, Annals of Operations Research, 102, 49-64, (2001).
11. E. Nowicki and C. Smutnicki, A fast taboo search algorithm for the job shop problem, Management Science, 42(6), 797-813, (1996).
12. W. P. M. Nuijten, Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. dissertation, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994.
13. J.-P. Watson, L. Barbulescu, L.D. Whitley, and A.E. Howe, Constrasting structured and random permutation flow-shop scheduling problems: search-space topology and algorithm performance, INFORMS Journal on Computing, 14(1), (2002).
14. N. Wilson, Algorithms for Dempster-Shafer Theory, in: Kohlas, J., Moral, S., (eds.) Algorithms for Uncertainty and Defeasible Reasoning, Volume 5, Handbook of Defeasible Reasoning, Kluwer Academic Publishers, 2000.