Matching based very large-scale neighborhoods for parallel machine scheduling

DOI10.1007/S10732-010-9149-8zbMATH Open1237.90084OpenAlexW2141035672MaRDI QIDQ415566FDOQ415566

Authors: Johann L. Hurink, Tobias Brueggemann 

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

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

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)

Cites Work

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

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)