抄録
After discussing that mix flexibility can be achieved by having either extra machine capacity or machine redundancy capable of performing different operations, this paper formulates a mix flexibility planning problem as a 0-1 mixed integer program with two levels. The first level gives a minimal cost solution meeting all possible combinations of production rates of different parts to be processed. The second level seeks for a cheaper solution at the sacrifice of losing mix flexibility.
