Solving Scheduling Problems with Setup Times and Alternative Resources

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 92-101

  Focacci, F ^a   Laborie, P ^b   Nuijten, W ^b  

^a UNIVERSITY OF FERRARA   (Italy)

^b ILOGSA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING;

COOPERATIVE MODEL; GENERAL SHOPS; MAKESPAN; MULTIPATH MODELS; OPTIMIZATION CRITERIA; PROBLEM-BASED; SCHEDULING PROBLEM; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; SHOP SCHEDULING;

CONSTRAINT PROGRAMMING;

EID: 85166265327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Allahverdi, A.; Gupta, .T.; and Aldowaisan, T. 1998. A review of scheduling research involving setup consideration. Omega forthcoming.
2. Baptiste. P.; Le Papo. C; and Nuijtcn, W. 1995. Incorporating efficient operations research algorithms in constraint-based scheduling. In Proc. 1st International Joint Workshop on Artificial Intelligence and Operations Research.
3. Beck, .1. C. 1999. Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. Ph.D. Dissertation. University of Toronto.
4. Brucker. P., and O-Thie.le. 1996. A branch and bound method for the general shop problem with sequence dependent setup-times. OR Spektrum 18:145 161.
5. Carpando, G.; Martello, S.: and Toth. P. 1988. Algorithms and codes for the assignment problem. Annals of Operations Research 13:193 -223.
6. Caseau, Y., and Laburthe, F. 1995. Disjunctive scheduling with task intervals. Technical report. Ecole Normale Supérieure.
7. Dell'Amico. M., and Martello, S. 1997. Linear assignment. In Dell'Amico. M.; Maffioli, F.; and Martello, S., eds.. Annotated Bibliographies in Combinatorial Optimization. Wiley.
8. Focacci, F .; Lodi, A.; Milano, M.: and Vigo, D. 1998. Solving TSP through the integration of OR and CP techniques. Proc. CP98 Workshop on Large Scale Combinatorial Optimisation and Constraints.
9. Focacci, F .; Lodi, A.; and Milano, M. 1999a. Cost-based domain filtering. Proc. International Conference on Principles and Practice of Constraint Programming GP99.
10. Focacci. F.; Lodi. A.; and Milano. M. 1999b. Solving tsp with time windows with constraints. In ICLP'99 International Conference, on Logic Programming.
11. Harvey. W., and Ginsberg, M. 1995. Limited discrepancy search. ' Pive. IJCAI95.
12. Laboric. P. 1999. Modal precedence graphs and their usage in ILOG Scheduler. Technical Report OIR.-1999-1. ILOG.
13. Le Pape, C.: and Baptiste. P. 1996. Constraint propagation techniques for disjunctive scheduling: The preemptive case. In Proc. 12th European Confeir.nce on Artificial Intelligence.
14. Nuijtcn, \V.. and Le Pape, C. 1998. Constraint-based job shop scheduling with ILOG SCHEDULER. Journal of Heuristics 3:271-286.
15. Nuijten, W. 1994. Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach. Ph.D. Dissertation, Eindhoven University of Technology.
16. Perron, L. 1999. Integration into constraint programming and parallelization of or/ai search methods. In CP-AIOR'99 Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems.
17. Scheduler. 1999. ILOG Scheduler 44 User's Manual and Reference Manual. I L O G, S.A.