Loading…
Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach
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 th...
Saved in:
Published in: | The Journal of the Operational Research Society 1991-01, Vol.42 (1), p.75-82 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 0160-5682 1476-9360 |
DOI: | 10.1057/jors.1991.9 |