Wednesday, 16:15 - 16:40 h, Room: H 2013

 

RĂ¼diger Stephan
Smaller compact formulation for lot-sizing with constant batches

 

Abstract:
We consider a variant of the classical lot-sizing problem in which the capacity in each period is an integer multiple of some basic batch size. Pochet and Wolsey (MathOR 18, 1993) presented an O(n2 min{n,C}) algorithm to solve this problem and a linear program with O(n3) variables and inequalities, where n is the number of periods and C the batch size. We provide a linear program of size O(n2 min{n,C}), that is, in case that C < n, our formulation is smaller.

 

Talk 3 of the contributed session Wed.3.H 2013
"Scheduling III" [...]
Cluster 11
"Integer & mixed-integer programming" [...]

 

  Payday Loans In Texas. Therefore, we can say that the active substances in its composition are more perfectly mixed. Vardenafil is not only present in the original Levitra Online, but also as part of its analogs.