tlooto
Sign up
EngineeringComputer Science

Routing and scheduling in a flexible job shop by tabu search

P. Brandimarte

1993.5.1ANNALS OF OPERATIONS RESEARCH

DOI: 10.1007/bf02023073

tlooto Summary

A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic, which allows to adapt the same basic algorithm to different objective functions.

Abstract

Abstract is not available.

Citation format

BRANDIMARTE, P. Routing and scheduling in a flexible job shop by tabu search. ANNALS OF OPERATIONS RESEARCH, 1993, 41: 157–183.