# Production planning problem ??? # ILOG Planner 0.9 User's Manual, Chapter 4 param T integer > 1; set PROD; set RSRC; param batch {PROD} integer > 0; param botch {RSRC} integer > 0; param stcost {PROD,1..T} > 0; param demand {PROD,1..T} > 0; param rescap {RSRC,1..T} > 0; param consmp {RSRC,PROD} > 0; var Xprod {RSRC,PROD,1..T} integer >= 0; var Store {PROD,1..T} integer >= 0; minimize StoreCost: stcost["p1",1] * Store["p1",1] + sum {p in PROD, t in 1..T: p != "p1" and t != 1} stcost[p,t] * Store[p,t]; subj to Capacity {r in RSRC, t in 1..T}: sum {p in PROD} consmp[r,p] * Xprod[r,p,t] <= rescap[r,t]; subj to Demand {p in PROD, t in 2..T}: Store[p,t-1] + sum {r in RSRC} botch[r] * Xprod[r,p,t] >= demand[p,t]; subj to Balance {p in PROD, t in 2..T}: Store[p,t-1] + sum {r in RSRC} batch[p] * Xprod[r,p,t] = demand[p,t] + Store[p,t]; subj to StoreInit {p in PROD}: Store[p,1] = 0; data; param T := 4; set PROD := p1 p2 p3 ; set RSRC := r1 r2 ; param batch := p1 10 p2 20 p3 30 ; param botch := r1 10 r2 20 ; param stcost: 1 2 3 4 := p1 5 6 7 4 p2 4 5 7 5 p3 3 6 6 4 ; param demand: 1 2 3 4 := p1 13 12 15 11 p2 11 12 13 14 p3 15 13 12 11 ; param rescap: 1 2 3 4 := r1 10 20 40 30 r2 20 40 30 20 ; param consmp: p1 p2 p3 := r1 1 2 1 r2 2 3 1 ; var Xprod [r1,*,*]: 1 2 3 4 := p1 0 0 0 0 p2 0 .6 .65 .7 p3 0 0 0 0 [r2,*,*]: 1 2 3 4 := p1 0 1.2 1.5 1.1 p2 0 .3 .325 .35 p3 0 .65 .275 .4125 ; var Store : 1 2 3 4 := p1 0 0 0 0 p2 0 0 0 0 p3 0 6.5 2.75 4.125 ;