Matching based very large-scale neighborhoods for parallel machine scheduling

DOI10.1007/S10732-010-9149-8MaRDI QIDQ415566zbMATH OpenOpenAlexFDO

Authors Johann L. Hurink, Tobias Brueggemann

Publication date 8 May 2012

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

zbMATH Keywords

local searchschedulingparallel machinestotal weighted completion timevery large-scale neighborhoods

Mathematics Subject Classification ID

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

Recommendations

• Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• Two very large-scale neighborhoods for single machine scheduling
• VLSN search algorithms for partitioning problems using matching neighbourhoods
• A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3550182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• A PTAS for minimizing the total weighted completion time on identical parallel machines.
• A survey of very large-scale neighborhood search techniques
• Algorithms for Scheduling Independent Tasks
• An exponential neighborhood for a one-machine batching problem
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• Creating very large scale neighborhoods out of smaller ones by compounding moves
• Maximum matching and a polyhedron with 0,1-vertices
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling by column generation
• Scheduling identical parallel machines to minimize total weighted completion time
• Scheduling with parallel processors and linear delay costs
• Solving Parallel Machine Scheduling Problems by Column Generation
• Two very large-scale neighborhoods for single machine scheduling
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

Cited in

(5)

• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
• Two very large-scale neighborhoods for single machine scheduling
• Matheuristics: survey and synthesis
• Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
• Split-merge: using exponential neighborhood search for scheduling a batching machine

This page was built for publication: Matching based very large-scale neighborhoods for parallel machine scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415566)