Agent-based hybrid tabu-search heuristic for dynamic scheduling
This paper proposes an agent-based hybrid tabu-search heuristic (AB-TSH) to solve dynamic flexible job-shop scheduling problems. The solution is fully implemented and tested in an industrial environment for seven distinct dynamic scenarios derived from a static scenario using the benchmark of AIP-PRIMECA Flexible Manufacturing System.