1. Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3(2), 149–156 (1991)
2. Beck, J.C., Refalo, P.: A hybrid approach to scheduling with earliness and tardiness costs. In: Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2001), pp. 175–188 (2001)
3. Beck, J.C., Refalo, P.: Combining local search and linear programming to solve earliness/tardiness scheduling problems. In: Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR 2002), pp. 221–235 (2002)
4. Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. Technical Report 03-005, ILOG (2003)
5. Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Technical Report 03-004, ILOG (2003)