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.
|Titolo:||Set-up coordination between two stages of a supply chain|
|Data di pubblicazione:||2001|
|Digital Object Identifier (DOI):||10.1023/A:1014934612090|
|Appare nelle tipologie:||1.1 Articolo in rivista|