Five pitfalls of empirical scheduling research

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1330, Issue , 1997, Pages 390-404

  Beck, J Christopher ^a   Davenport, Andrew J ^a   Fox, Mark S ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING;

CPU TIME; EVALUATION CRITERIA; EXPERIMENTAL PROBLEMS; MAKESPAN; SCHEDULING RESEARCH; VIEWING ALGORITHMS;

SCHEDULING ALGORITHMS;

EID: 84948956173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0017455     Document Type: Conference Paper

References (41)

1. AAAI Empirical Workshop (1994), Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods.
2. Allen, J, F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26(ll):832-843.
3. Beasley, J. E. (1990). OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41 (11); 1069-1072. Also available by ftp from ftp:// graph.ms.ic.ac.uk/pub/paper.txt.
4. Beck, J. C. (1994). A schema for constraint relaxation with instantiations for partial constraint satisfaction and schedule optimization. Master's thesis, Department of Computer Science, University of Toronto.
5. Beck, J. C. (1997). A generic framework for constraint-directed search and scheduling. Technical report, Department of Industrial Engineering, University of Toronto, 4 Taddle Creek Road, Toronto, Ontario M5S 3G9, Canada.
6. Beck, J. C., Davenport, A. J., Sitarski, E. M., and Fox, M. S. (1997a). Beyond contention: extending texture-based scheduling heuristics. In Proceedings of AAAI-97. AAAI Press, Menlo Park, California.
7. Beck, J. C., Davenport, A. J., Sitarski, E. M., and Fox, M. S. (1997b), Texture-based heuristics for scheduling revisited. In Proceedings of AAAI-97, AAAI Press, Menlo Park, California.
8. Beck, J. C. and Jackson, K. (1997). Constrainedness and the phase transition in job shop scheduling. Technical report, School of Computing Science, Simon Fraser University.
9. Brucker, P. and Thiele, O. (1996). A branch & bound method for the general-shop problems with sequence dependent set-up times. OR Spektrum, 18:145-161.
10. Carlier, J. and Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2):164-176.
11. Caseau, Y. and Laburthe, F. (1996). Cumulative scheduling with task intervals. In Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press.
12. Cheeseman, P., Kanefsky, B., and Taylor, W. (1991). Where the really hard problems are. In Proceedings ofIJCÁI-91, volume 1, pages 331-337.
13. Cheng, C. C. and Smith, S. F. (1996). Applying constraint satisfaction techniques to job shop scheduling. Annals of Operations Research, Special Volume on Scheduling: Theory and Practice, ł. Forthcoming.
14. Cohen, P. R. (1995). Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge, Mass.
15. Davenport, A. J., Beck, J, C., and Fox, M. S. (1997). Propagation over the meets temporal constraint. Technical report, Department of Industrial Engineering, University of Toronto
16. Drummond, M., Bresina, J., and Swanson, K. (1994). Just-in-case scheduling. In Proceedings of AAAI-94, pages 1098-1104, Menlo Park, CA. AAAI Press/MIT Press.
17. ECAI Empirical Workshop (1996). Proceedings of the ECÄI-96 Workshop on Empirical Artificial Intelligence.
18. Erschler, J., Roubellat, F., and Vemhes, J. P. (1976). Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research, 24:772-782.
19. Erschler, J., Roubellat, F., and Vemhes, J. P. (1980). Characterising the set of feasible sequences for n jobs to be carried out on a single machine. European Journal of Operational Research, 4:189-194.
20. Fox, M. S. (1983). Constraint-Directed Search: A Case Study of Job-Shop Scheduling. PhD thesis, Carnegie Mellon University, Intelligent Systems Laboratory, The Robotics Institute, Pittsburgh, PA. CMU-RI-TR-85-7.
21. Fox, M. S. (1990). Constraint-guided scheduling-a short history of research at CMU. Computers in Industry, 14:79-88.
22. Gent, I. P., Grant, S. A., MacIntyre, E., Prosser, P., Shaw, P., Smith, B. M., and Walsh, T. (1997). How not to do it. Technical Report 97.27, School of Computer Studies, University of Leeds.
23. Gent, I. P., MacIntyre, E., Prosser, P., and Walsh, T. (1996). The constrainedness of search. In Proceedings of AAAI-96, volume 1, pages 246-252.
24. Harvey, W. D. (1995). Nonsystematic backtracking search. PhD thesis, Department of Computer Science, Stanford University.
25. Harvey, W. D. and Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings oflJCAI-95, pages 607-613.
26. Hildum, D. W. (1994). Flexibility in a knowledge-based system for solving dynamic resource-constrained scheduling problems. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, MA. 01003-4610. UMass CMPSCI TR 94-77.
27. Hooker, J. N. (1994). Needed: An empirical science of algorithms. Operations Research, 42:201212.
28. Hooker, J. N. (1996). Testing heuristics: We have it all wrong. Journal of Heuristics, 1:33-42.
29. Le Pape, C. (1994a). Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3(2):55-66.
30. Le Pape, C. (1994b). Using a constraint-based scheduling library to solve a specific scheduling problem. In Proceedings of the ÁAAI-SIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes.
31. Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings ofIJCAI-93, volume 1, pages 232-238.
32. Muscettola, N. (1992). Scheduling by iterative partition of bottleneck conflicts. Technical Report CMU-RI-TR-92-05, The Robotics Institute, Carnegie Mellon University.
33. Nuijten, W. and Aarts, E. (1997). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research. To appear.
34. Nuijten, W. P. M. (1994). Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology.
35. Ow, P. S., Smith, S. F., and Thiriez, A. (1988). Reactive plan revision. In Proceedings of AAAI-88, pages 77-82. AAAI.
36. Sadeh, N. (1991). Lookahead techniques for micro-opportunistic job-shop scheduling. PhD thesis, Camegie-Mellon University. CMU-CS-91-102.
37. Saks, V. (1992). Distribution planner overview. Technical report, Carnegie Group, Inc., Pittsburgh, PA, 1522.
38. Smith, S. F. and Cheng, C. C. (1993). Slack-based heuristics for constraint satisfaction scheduling, in Proceedings AAAI-93, pages 139-144.
39. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278-285.
40. Xiong, Y., Sadeh, N., and Sycara, K. (1992). Intelligent backtracking techniques for job-shop scheduling. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA.
41. Zweben, M., Davis, E., Daun, B., and Deale, M. (1993). Informedness vs, computational cost of heuristics in iterative repair scheduling. In Proceedings of IJCAI-93, pages 1416-1422.