Constraint programming for scheduling

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 47-1-47-22

  Kanet, John J ^a   Ahire, Sanjay L ^a   Gorman, Michael F ^a  

^a UNIVERSITY OF DAYTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055822422     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (31)

1. Baptiste, P., Le Pape, C., and Nuijten, W., Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems, Kluwer Academic Publishers, Boston, MA, 2001.
2. Tsang, E., Foundations of Constraint Satisfaction, Wiley, Chichester, England, 1994.
3. VanHentenryck, P., Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA, 1989.
4. Brailsford, S. C., Potts, C. N., and Smith, B. M., Constraint satisfaction problems: algorithms and applications, European Journal of Operational Research, 119, 557, 1999.
5. Williams, H. andWilson, J., Connections between integer linear programming and constraint logic programming — an overview and introduction to the cluster of articles, INFORMS Journal on Computing, 10, 261, 1998.
6. Freuder, E. C. and Wallace, M., Constraint satisfaction, in: Glover, F. and Kochenberger, G. A. (eds.) Handbook of Metaheuristics, Kluwer Academic Publishers, Boston, MA, 2003, chap. 14.
7. Nuijten, W. and Aarts, E., A computational study of constraint satisfaction for multiple capacitated job shop scheduling, European Journal of Operational Research, 90, 269, 1996.
8. Lustig, I. and Puget, J., Program does not equal program: constraint programming and its relation to mathematical programming, Interfaces, 31, 29, 2001.
9. Darby-Dowman, K., Little, J., Mitra, G., andZaffalon, M., Constraint logic programmingand integer programming approaches and their collaboration in solving an assignment scheduling problem, Constraints, 1, 245, 1997.
10. Jordan, C. and Drexl, A., A comparison of constraint and mixed integer programming solvers for batch sequencing with sequence dependent setups, ORSA Journal on Computing, 7, 160, 1995.
11. Jain, V. and Grossman, I., Algorithms for hybrid MILP/CP models for a class of optimization problems, INFORMS Journal on Computing, 13, 258, 2001.
12. Henz, M., Scheduling a major college basketball conference — revisited, Operations Research, 49, 163, 2001.
13. Nemhauser, G. and Trick, M., Scheduling a major college basketball conference, Operations Research, 46, 1, 1998.
14. Baker, K., Magazine, M., and Polak, G., Optimal block design models for course timetabling, Operations Research Letters, 30, 1, 2002.
15. Valouxis, C. andHousos, E., Constraint programmingapproachfor school timetabling, Computers& Operations Research, 30, 1555, 2003.
16. Rousseau, L., Gendreau, M., and Pesant, G., The synchronized vehicle dispatching problem, Working Paper, Center for Transportation Research, University of Montreal, 2002.
17. Hooker, J. N., Logic, optimization, and constraint programming, INFORMS Journal on Computing, 14, 295, 2002.
18. Milano, M., Ottoson, G., Refalo, P., and Thorsteinsson, E., The role of integer programming techniques in constraint programming’s global constraints, INFORMS Journal on Computing, 4, 387, 2002.
19. Hillier, F. S. and Lieberman, G. J., Introduction to Operations Research, Holden-Day, Inc., San Francisco, 1980.
20. Williams, H. P., Model Building in Mathematical Programming, Wiley, New York, 1999.
21. Pinedo, M., Scheduling: Theory Algorithms, and Systems, Prentice Hall, Englewood Cliffs, NJ, 1995.
22. Du, J. and Leung, J. Y.-T., Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research, 15, 483, 1990.
23. Potts, C. N. andVanWassenhove, L. N., Abranchandboundalgorithm for the totalweighted tardiness problem, Operations Research, 33, 363, 1985.
24. Van Hentenryck, P., The OPL Optimization Programming Language, MIT Press, Cambridge, MA, 1999.
25. Elmaghraby, S. E., The one machine sequencing problem with delay costs, Journal of Industrial Engineering, 19, 105, 1968.
26. Kanet, J. J. and Li, X., A weighted modified due date rule for sequencing to minimize weighted tardiness, Journal of Scheduling (forthcoming).
27. Baker, K. R., Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
28. Akturk, M. S. and Yildirim, M. B., A new dominance rule for the total weighted tardiness problem, Production Planning & Control, 10, 138, 1999.
29. Rachamadugu, R. M. V., A note on the weighted tardiness problem, Operations Research, 35, 450, 1987.
30. Rinnooy Kan, A. H. G., Lageweg, B. J., and Lenstra, J. K., Minimizing total costs in one-machine scheduling, Operations Research, 23, 908, 1975.
31. Baker, K. R., Elements of Sequencing and Scheduling, K. R. Baker (ed.), Hanover, NH, 2000.