Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times

DOI10.1007/11751595_77zbMath1172.90402OpenAlexW1502742993MaRDI QIDQ3600157

Hyun-Seon Choi, Sangil Kim, Dong-Ho Lee

Publication date: 10 February 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751595_77

Mathematics Subject Classification ID

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

Related Items (3)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

This page was built for publication: Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times