Matching based very large-scale neighborhoods for parallel machine scheduling

DOI10.1007/s10732-010-9149-8zbMath1237.90084OpenAlexW2141035672MaRDI QIDQ415566

Tobias Brueggemann, Johann L. Hurink

Publication date: 8 May 2012

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-010-9149-8

zbMATH Keywords

schedulingparallel machineslocal searchtotal weighted completion timevery large-scale neighborhoods

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Split-merge: using exponential neighborhood search for scheduling a batching machine, Matheuristics: survey and synthesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• Scheduling identical parallel machines to minimize total weighted completion time
• An exponential neighborhood for a one-machine batching problem
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Two very large-scale neighborhoods for single machine scheduling
• A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
• Parallel Machine Scheduling by Column Generation
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Solving Parallel Machine Scheduling Problems by Column Generation
• Scheduling with parallel processors and linear delay costs
• Maximum matching and a polyhedron with 0,1-vertices