Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs
- 1 January 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Structured vs. Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness CostsLecture Notes in Computer Science, 2003
- Using Constraint Programming and Local Search Methods to Solve Vehicle Routing ProblemsLecture Notes in Computer Science, 1998
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991