{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:52:25Z","timestamp":1752461545461},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637530"},{"type":"electronic","value":"9783540696421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017455","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:46Z","timestamp":1132644166000},"page":"390-404","source":"Crossref","is-referenced-by-count":5,"title":["Five pitfalls of empirical scheduling research"],"prefix":"10.1007","author":[{"given":"J. Christopher","family":"Beck","sequence":"first","affiliation":[]},{"given":"Andrew J.","family":"Davenport","sequence":"additional","affiliation":[]},{"given":"Mark S.","family":"Fox","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"31_CR1","unstructured":"AAAI Empirical Workshop (1994). Proceedings of the AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods."},{"issue":"11","key":"31_CR2","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. F. Allen","year":"1983","unstructured":"Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832\u2013843.","journal-title":"Communications of the ACM"},{"issue":"11","key":"31_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069\u20131072. Also available by ftp from ftp:\/\/ graph.ms.ic.ac.uk\/pub\/paper.txt.","journal-title":"Journal of the Operational Research Society"},{"key":"31_CR4","unstructured":"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."},{"key":"31_CR5","unstructured":"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."},{"key":"31_CR6","volume-title":"Proceedings of AAAI-97","author":"J. C. Beck","year":"1997","unstructured":"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."},{"key":"31_CR7","volume-title":"Proceedings of AAAI-97","author":"J. C. Beck","year":"1997","unstructured":"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."},{"key":"31_CR8","unstructured":"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."},{"key":"31_CR9","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","volume":"18","author":"P. Brucker","year":"1996","unstructured":"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\u2013161.","journal-title":"OR Spektrum"},{"issue":"2","key":"31_CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J. and Pinson, E. (1989). An algorithm for solving the job-shop problem. Management Science, 35(2):164\u2013176.","journal-title":"Management Science"},{"key":"31_CR11","unstructured":"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."},{"key":"31_CR12","first-page":"331","volume":"1","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanefsky, B., and Taylor, W. (1991). Where the really hard problems are. In yProceedings of IJCAI-91, volume 1, pages 331\u2013337.","journal-title":"yProceedings of IJCAI-91"},{"key":"31_CR13","unstructured":"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, 1. Forthcoming."},{"key":"31_CR14","volume-title":"Empirical Methods for Artificial Intelligence","author":"P. R. Cohen","year":"1995","unstructured":"Cohen, P. R. (1995). Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge, Mass."},{"key":"31_CR15","unstructured":"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."},{"key":"31_CR16","first-page":"1098","volume-title":"Proceedings of AAAI-94","author":"M. Drummond","year":"1994","unstructured":"Drummond, M., Bresina, J., and Swanson, K. (1994). Just-in-case scheduling. In Proceedings of AAAI-94, pages 1098\u20131104, Menlo Park, CA. AAAI Press\/MIT Press."},{"key":"31_CR17","unstructured":"ECAI Empirical Workshop (1996). Proceedings of the ECAI-96 Workshop on Empirical Artificial Intelligence."},{"key":"31_CR18","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.24.4.774","volume":"24","author":"J. Erschler","year":"1976","unstructured":"Erschler, J., Roubellat, F., and Vernhes, J. P. (1976). Finding some essential characteristics of the feasible solutions for a scheduling problem. Operations Research, 24:772\u2013782.","journal-title":"Operations Research"},{"key":"31_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(80)90005-3","volume":"4","author":"J. Erschler","year":"1980","unstructured":"Erschler, J., Roubellat, F., and Vernhes, 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\u2013194.","journal-title":"European Journal of Operational Research"},{"key":"31_CR20","series-title":"CMU-RI-TR-85-7","volume-title":"Constraint-Directed Search: A Case Study of Job-Shop Scheduling","author":"M. S. Fox","year":"1983","unstructured":"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."},{"key":"31_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-3615(90)90107-Z","volume":"14","author":"M. S. Fox","year":"1990","unstructured":"Fox, M. S. (1990). Constraint-guided scheduling-a short history of research at CMU. Computers in Industry, 14:79\u201388.","journal-title":"Computers in Industry"},{"key":"31_CR22","unstructured":"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."},{"key":"31_CR23","first-page":"246","volume":"1","author":"I. P. Gent","year":"1996","unstructured":"Gent, I. P., MacIntyre, E., Prosser, P., and Walsh, T. (1996). The constrainedness of search. In Proceedings ofAAAI-96, volume 1, pages 246\u2013252.","journal-title":"Proceedings ofAAAI-96"},{"key":"31_CR24","unstructured":"Harvey, W. D. (1995). Nonsystematic backtracking search. PhD thesis, Department of Computer Science, Stanford University."},{"key":"31_CR25","unstructured":"Harvey, W. D. and Ginsberg, M. L. (1995). Limited discrepancy search. In Proceedings of IJCAI-95, pages 607\u2013613."},{"key":"31_CR26","series-title":"UMass CMPSCI TR 94-77","volume-title":"Flexibility in a knowledge-based system for solving dynamic resourceconstrained scheduling problems","author":"D. W. Hildum","year":"1994","unstructured":"Hildum, D. W. (1994). Flexibility in a knowledge-based system for solving dynamic resourceconstrained scheduling problems. PhD thesis, Department of Computer Science, University of Massachusetts, Amherst, MA. 01003-4610. UMass CMPSCI TR 94-77."},{"key":"31_CR27","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J. N. Hooker","year":"1994","unstructured":"Hooker, J. N. (1994). Needed: An empirical science of algorithms. Operations Research, 42:201\u2013212.","journal-title":"Operations Research"},{"key":"31_CR28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. N. Hooker","year":"1996","unstructured":"Hooker, J. N. (1996). Testing heuristics: We have it all wrong. Journal ofHeuristics, 1:33\u201342.","journal-title":"Journal ofHeuristics"},{"issue":"2","key":"31_CR29","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"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\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"31_CR30","unstructured":"Le Pape, C. (1994b). Using a constraint-based scheduling library to solve a specific scheduling problem. In Proceedings of the AAAI-SIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes."},{"key":"31_CR31","first-page":"232","volume":"1","author":"O. Lhomme","year":"1993","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings of IJCAI-93, volume 1, pages 232\u2013238.","journal-title":"Proceedings of IJCAI-93"},{"key":"31_CR32","doi-asserted-by":"crossref","unstructured":"Muscettola, N. (1992). Scheduling by iterative partition of bottleneck conflicts. Technical Report CMU-RI-TR-92-05, The Robotics Institute, Carnegie Mellon University.","DOI":"10.21236\/ADA255839"},{"key":"31_CR33","unstructured":"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."},{"key":"31_CR34","unstructured":"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."},{"key":"31_CR35","unstructured":"Ow, P. S., Smith, S. F., and Thiriez, A. (1988). Reactive plan revision. In Proceedings of AAAI-88, pages 77\u201382. AAAI."},{"key":"31_CR36","unstructured":"Sadeh, N. (1991). Lookahead techniques for micro-opportunistic job-shop scheduling. PhD thesis, Carnegie-Mellon University. CMU-CS-91-102."},{"key":"31_CR37","series-title":"Technical report","volume-title":"Distribution planner overview","author":"V. Saks","year":"1992","unstructured":"Saks, V. (1992). Distribution planner overview. Technical report, Carnegie Group, Inc., Pittsburgh, PA, 1522."},{"key":"31_CR38","unstructured":"Smith, S. F. and Cheng, C. C. (1993). Slack-based heuristics for constraint satisfaction scheduling. In Proceedings AAAI-93, pages 139\u2013144."},{"key":"31_CR39","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"31_CR40","unstructured":"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."},{"key":"31_CR41","unstructured":"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\u20131422."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming-CP97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T09:58:59Z","timestamp":1549360739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637530","9783540696421"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/bfb0017455","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}