Name
Abstract | ||
|---|---|---|
In the material flow of a plant, parts are processed in batches, each having two distinct attributes, say shape and color. In one department, a set-up occurs every time the shape of the new batch is different from the previous one. In a downstream department, there is a set-up when the color of the new batch is different from the previous one. Since a unique sequence of batches must be established, the problem consists in finding such a common sequence optimizing an overall utility index. Here we consider two indices, namely the total number of set-ups and the maximum number of set-ups between the two departments. Both problems are shown to be NP-hard. An efficient heuristic approach is presented for the first index which allows to solve a set of real-life instances and performs satisfactorily on a large sample of experimental data. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1023/A:1014934612090 | Annals OR |
Keywords | Field | DocType |
scheduling,coordination,supply chain | Mathematical optimization,Heuristic,Experimental data,Scheduling (computing),Material flow,Supply chain,Mathematics | Journal |
Volume | Issue | ISSN |
107 | 1-4 | 1572-9338 |
Citations | PageRank | References |
22 | 1.49 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Agnetis | 1 | 408 | 30.67 |
| Paolo Detti | 2 | 144 | 19.55 |
| Carlo Meloni | 3 | 71 | 9.79 |
| Dario Pacciarelli | 4 | 826 | 49.60 |