Job shop scheduling with tooling constraints: A tabu search approach

Job shop scheduling with tooling constraints: A tabu search approach

0.00 Avg rating0 Votes
Article ID: iaor19911978
Country: United Kingdom
Volume: 42
Issue: 1
Start Page Number: 75
End Page Number: 82
Publication Date: Jan 1991
Journal: Journal of the Operational Research Society
Authors:
Keywords: heuristics
Abstract:

Flexible manufacturing systems (FMSs) are automated factories in which many different part types are produced simultaneously. The tool-loading problem now adds further to the delicate task of finding an optimal schedule for such systems. In this paper, a tabu search approach is developed to solve the job shop scheduling problem with tooling constraints.

Reviews

Required fields are marked *. Your email address will not be published.