作者: Michele Ciavotta , Paolo Detti , Carlo Meloni , Marco Pranzo
DOI: 10.1016/J.EJOR.2006.09.102
关键词:
摘要: This paper addresses a problem arising in the coordination between two consecutive departments of production system, where parts are processed batches, and each batch is characterized by distinct attributes. Due to lack interstage buffering stages, these have follow same sequence. In first department, setup occurs every time attribute new different from one previous batch. downstream there when second changes batches. The consists finding sequence optimizing number setups paid department. case results particular bi-objective combinatorial optimization problem. We present geometrical characterization for feasible solution set problem, we propose three effective heuristics, as shown an extensive experimental campaign. proposed approach can be also used solve class single-objective problems, which costs general increasing functions setups.