Rolling-horizon lot-sizing when set-up times are sequence-dependent

摘要

The challenging problem of efficient lot sizing on parallel machines with sequence- dependent set-up times is modelled using a new mixed integer programming (MIP) formulation that permits multiple set-ups per planning period. The result- ing model is generally too large to solve optimally and, given that it will be used on a rolling horizon basis with imperfect demand forecasts, approximate models that only generate exact schedules for the immediate periods are developed.