This paper addresses a problem arising in the coordination between two consecutive manufacturing departments of a production system, in which parts are processed in batches, and each batch is characterized by two distinct attributes. Due to limited interstage buffering between the two stages, the two departments have to follow the same batch sequence. In the first department, a setup occurs every time the first attribute of the new batch is different from the previous one. In the downstream department, there is a setup when the second attribute of the new batch changes. The problem consists of finding a common batch sequence optimizing some global utility index. Here we propose a metaheuristic approach to a bi-criteria version of the problem considering two indices, namely the total number of setups paid for by the two departments and the maximum number of setups paid for by either department.
|Titolo:||Minimizing and balancing setups in a serial production system|
|Data di pubblicazione:||2007|
|Digital Object Identifier (DOI):||10.1080/00207540701636306|
|Appare nelle tipologie:||1.1 Articolo in rivista|