Integer programming and constraint programming in solving a multimachine assignment scheduling problem with deadlines and release dates

INFORMS Journal on Computing

Volumn 18, Issue 2, 2006, Pages 209-217

  Sadykov, Ruslan ^a   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Constraint programming; Hybrid algorithms; Integer programming; Multimachine scheduling

Indexed keywords

EID: 33745697691     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0110     Document Type: Article

References (10)

1. Baptiste, P., A. Jouglet, C. Le Pape, W. Nuijten. 2000. A constraint-based approach to minimize the weighted number of late jobs on parallel machines. Research report 2000/288, University of Technology of Compiègne, Unité Mixte de Recherche, CNRS 6599, Heudiasyc, France.
2. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Boston, MA.
3. Bockmayr, A., N. Pisaruk. 2003. Detecting infeasibility and generating cuts for MIP using CP. Internat. Workshop Integration AI OR Techniques Constraint Programming Combin. Optim. Problems CP-AI-OR'03, Montreal, Canada, http://www.crt.umontreal.ca/cpaior/article-bockmayr.pdf.
4. Carlier, J. 1982. The one machine sequencing problem. Eur. J. Oper. Res. 11 42-17.
5. Chen, Z.-L., W. B. Powell. 1999. Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11 78-94.
6. Colombani, Y., T. Heipcke. 2002. Mosel: An extensible environment for modeling and programming solutions. Internat. Workshop Integration AI OR Techniques Constraint Programming Combin. Optim. Problems CP-AI-OR'02, Le Croisic, France, 277-290.
7. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
8. Jain, V., I. E. Grossman. 2001. Algorithms for hybrid MILP/CLP models for a class of optimization problems. INFORMS J. Comput. 13 258-276.
9. Juncker, U., S. Karish, N. Kohl, B. Vaaben, T. Fahle, M. Sellman. 1999. A framework for constraint programming based column generation. Internat. Conf. Principles Practice Constraint Programming CP'99, LNCS 1713, Springer, Berlin, Germany, 261-274.
10. Peridy, L., E. Pinson, D. Rivreau. 2003. Using short-term memory to minimize the weighted number of late jobs on a single machine. Eur. J. Oper. Res. 148 591-603.