Planning and scheduling in a multi-site environment

scheduling problem is decomposed into independent scheduling problems (one for each site), that can be solved in parallel. The approach is presented and computational results are reported. In this paper, we consider an integrated model for scheduling and planning in a multi-site environment in order to determine a feasible plan, i.e. a plan with at least a feasible sequence in each site. Our method alternates between solving a planning problem in which lot-sizes are computed for a given sequence of jobs on each machine, and a scheduling problem in which sequences are computed in each site. In fact, the latter