Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates

References

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