Planning and scheduling in a multi-site environment

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 p lan with at least a feasible sequence in each site. Our method alternates b etween solving a planning problem in which lot-sizes are computed for a giv en sequence of jobs on each machine, and a scheduling problem in which sequ ences are computed in each site. In fact, thr latter scheduling problem is decomposed into independent scheduling problems (one for each site), that c an be solved in parallel. Thr approach is presented and computational resul ts are reported.