Skip to main content
Journal Article

Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2833 817-821
DOI: 10.1007/978-3-540-45193-8_59
34Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Danna, E., & Perron, L. (2003). Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2833, 817–821. https://doi.org/10.1007/978-3-540-45193-8_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free