Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times

Documenti analoghi

• Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
  di: Grüttemeier, Niels, et al.
  Pubblicazione: (2025)
• Complexity of Local Search for Euclidean Clustering Problems
  di: Manthey, Bodo, et al.
  Pubblicazione: (2023)
• Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
  di: Herrmann, Anton, et al.
  Pubblicazione: (2025)
• Parameterized Local Search for Max $c$-Cut
  di: Garvardt, Jaroslav, et al.
  Pubblicazione: (2024)
• Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
  di: Komusiewicz, Christian, et al.
  Pubblicazione: (2026)