A bicriterion approach to deal with a constrained single-objective problem

An aluminium can production problem is considered and restated as a problem of scheduling unrelated parallel machines with sequence-dependent changeover times. The objective is to find the minimal cost schedule that respects a given production horizon. As this time constraint can be very difficult to meet, a bicriterion procedure is proposed to deal with the respect of the production horizon and the minimization of the set of costs (production, distribution, switchings).