On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: Constraint programming vs. mixed integer programming

[Lecture Notes in Computer Science] Prin

[Lecture Notes in Computer Science] Principles and Practice of Constraint Programming – CP 2003 Volume 2833 || Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs

✍ Rossi, Francesca 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 92 KB

This volume contains the proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), held in Kinsale, Ireland, from September 29 to October 3, 2003. Detailed information about the CP 2003 conference can be found at the URL http://www.cs.ucc.ie/cp