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

Abstract

We consider the problem of scheduling a set of independent jobs on parallel machines for the objective of minimizing total tardiness. Each job may have sequence-dependent setup and distinct ready times, i.e., the time at which the job is available for processing. Due to the complexity of the problem, tabu search heuristics are suggested that incorporate new… (More)
DOI: 10.1007/11751595_77

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Kim2006TabuSH, title={Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setup and Ready Times}, author={Sang-Il Kim and Hyun-Seon Choi and Dong-Ho Lee}, booktitle={ICCSA}, year={2006} }