A tabu-search heuristic for the flexible-resource flow shop scheduling problem

@article{Daniels1993ATH,
  title={A tabu-search heuristic for the flexible-resource flow shop scheduling problem},
  author={Richard L. Daniels and Joseph B. Mazzola},
  journal={Annals OR},
  year={1993},
  volume={41},
  pages={207-230}
}
This paper presents a tabu-search heuristic for the flexible-resource flow shop scheduling (FRFS) problem [7]. The FRFS problem generalizes the classic flow shop scheduling problem by allowing job-operation processing times to depend on the amount of resource assigned to an operation; the objective is to determine simultaneously the job sequence, resource-allocation policy, and operation start times that optimize system performance. The tabu-search heuristic (TSH) employs a nested-search… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS