Abstract
In this study, we address a part-type sequencing and tool switching problem arising in Flexible Manufacturing Systems. We consider the single machine problem of minimizing the number of tool switching instants. We propose two tabu search approaches to find high-quality solutions. Our computational results reveal that both tabu search approaches produce optimal or near-optimal solutions in reasonable times.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 298-307 |
| Number of pages | 10 |
| Journal | International Journal of Production Economics |
| Volume | 116 |
| Issue number | 2 |
| DOIs | |
| State | Published - Dec 1 2008 |
All Science Journal Classification (ASJC) codes
- General Business, Management and Accounting
- Economics and Econometrics
- Management Science and Operations Research
- Industrial and Manufacturing Engineering