Modeling the regular constraint with integer programming

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

Volumn 4510 LNCS, Issue , 2007, Pages 29-43

  Côté, Marie Claude ^a,c   Gendron, Bernard ^b,c   Rousseau, Louis Martin ^a,c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; FINITE AUTOMATA; GLOBAL OPTIMIZATION; GRAPH THEORY; INTEGER PROGRAMMING;

COMPUTATIONAL TIMES; CONSTRAINT PROGRAMMING; DETERMINISTIC FINITE AUTOMATA (DFA);

PROBLEM SOLVING;

EID: 37149035995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72397-4_3     Document Type: Conference Paper

References (26)

1. Pesant, G.: A regular membership constraint for finite sequences of variables. Proc. of CP'04, Springer-Verlag LNCS 3258 (2004) 482-495
2. Ernst, A., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research 153 (2004) 3-27
3. Ernst, A., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research 127 (2004) 21-144
4. Dantzig, G.: A comment on Edie's traffic delay at toll booths. Operations Research 2 (1954) 339-341
5. Segal, M.: The operator-scheduling problem: A network-flow approach. Operations Research 22 (1974) 808-823
6. Moondra, B.: An LP model for work force scheduling for banks. Journal of Bank Research 7 (1976) 299-301
7. Bechtolds, S., Jacobs, L.: Implicit optimal modeling of flexible break assigments. Management Science 36 (1990) 1339-1351
8. Bechtolds, S., Jacobs, L.: The equivalence of general set-covering and implicit integer programming formulations for shift scheduling. Naval Research Logistics 43 (1996) 223-249
9. Thompson, G.: Improved implicit modeling of the labor shift scheduling problem. Management Science 41 (1995) 595-607
10. Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science 42 (1996) 591-602
11. Brusco, M., Jacobs, L.: Personnel tour scheduling when starting-time restrictions are present. Management Science 44 (1998) 534-547
12. Laporte, G., Nobert, Y., Biron, J.: Rotating schedules. European Journal of Operational Research 4(1) (1980) 24-30
13. Balakrishan, A., Wong, R.: Model for the rotating workforce scheduling problem. Networks 20 (1990) 25-42
14. Isken, M.: An implicit tour scheduling model with applications in healthcare. Annals of Operations Research, Special Issue on Staff Scheduling and Rostering 128 (2004) 91-109
15. Çezik, T., Günlük, O., Luss., H.: An integer programming model for the weekly tour scheduling problem. Naval Research Logistic 48(7) (1999)
16. Millar, H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research 104(3) (1998) 582-592
17. Ernst, A., Hourigan, P., Krishnamoorthy, M., Mills, G., Nott, h., Sier, D.: Rostering ambulance officers. Proceedings of the 15th National Conference of the Australian Society for Operations Research, Gold Coast (1999) 470-481
18. Sodhi, M.: A flexible, fast, and optimal modeling approach applied to crew rostering at London Underground. Annals of Operations Research 127 (2003) 259-281
19. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison Wesley (1979)
20. van Hoeve, W.J., Pesant, G., Rousseau, L.M.: On global warming: Flow-based soft global constraints. Journal of Heuristics 12(4-5) (2006) 347-373
21. Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints 11(4) (2006) 315-333
22. Quimper, CG., Walsh, T.: Global grammar constraints. Proc. of CP'06, Springer-Verlag LNCS 4204 (2006) 751-755
23. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice Hall (1993)
24. Demassey, S., Pesant, G., Rousseau, L.M.: Constraint programming based column generation for employee timetabling. Proc. 2th Int. Conf. on Intergretion of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems - CPAIOR'05, Springer-Verlag LNCS 3524 (2005) 140-154
25. Achterberg, T.: SCIP - a framework to integrate constraint and mixed integer programming. Technical Report 04-19, Zuse Institute Berlin (2004) http://www.zib.de/Publications/abstracts/ZR-04-19/.
26. Sellmann, M.: The theory of grammar constraints. Proc. of CP'06, Springer-Verlag LNCS 4204 (2006) 530-544