Two very large-scale neighborhoods for single machine scheduling

DOI10.1007/s00291-006-0052-5zbMath1145.90018OpenAlexW2168847129MaRDI QIDQ2642308

Johann L. Hurink, Tobias Brueggemann

Publication date: 20 August 2007

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-006-0052-5

zbMATH Keywords

Single machineLocal searchVery large-scale neighborhoods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Split-merge: using exponential neighborhood search for scheduling a batching machine, The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems, Matheuristics: survey and synthesis, Matching based very large-scale neighborhoods for parallel machine scheduling, Hybridizations of evolutionary algorithms with large neighborhood search

Cites Work

• A survey of very large-scale neighborhood search techniques
• An exponential neighborhood for a one-machine batching problem
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item