Scheduling unrelated parallel machines with sequence-dependent setups

DOI10.1016/j.cor.2006.02.006zbMath1127.90032MaRDI QIDQ883307

Byran J. Smucker, Rasaratnam Logendran, Brent McDonell

Publication date: 4 June 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.006

zbMATH Keywords

tabu search; sequence-dependent setups; unrelated parallel machine scheduling

Mathematics Subject Classification ID

90B40: Search theory

90B35: Deterministic scheduling theory in operations research

Related Items

Planning production using mathematical programming: The case of a woodturning company

Cites Work

• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Unrelated parallel machine scheduling using local search
• A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• A tabu search algorithm for parallel machine total tardiness problem
• Heuristics for scheduling unrelated parallel machines
• An effective heuristic for minimising makespan on unrelated parallel machines
• The Single Machine Early/Tardy Problem
• Algorithms for Scheduling Tasks on Unrelated Processors
• The Total Tardiness Problem: Review and Extensions