| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142094 | Operations Research Letters | 2015 | 6 Pages |
Abstract
We revisit the tool switching problem on a flexible manufacturing machine. We present a polynomial algorithm for the problem of finding a switching plan that minimizes the number of tool switch instances on the machine, given a fixed job sequence. We prove tight hardness results for the variable sequence case with the same objective function, as well as a new objective function naturally arising in multi-feeder mailroom inserting systems.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Adjiashvili, Sandro Bosio, Kevin Zemmer,