On discrete lot-sizing and scheduling on identical parallel machines

Optimization Letters

Volumn 6, Issue 3, 2012, Pages 545-557

  Gicquel, C ^a   Wolsey, L A ^b   Minoux, M ^c  

^a LGI   (France)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Discrete lot sizing and scheduling; Identical parallel machines; Mixed integer linear programming; Reformulation; Valid inequalities

Indexed keywords

COMPUTATIONAL EXPERIMENT; EXTENDED FORMULATIONS; IDENTICAL PARALLEL MACHINES; INTEGER FLOW; INTEGER VARIABLES; LOT SIZING; MIXED-INTEGER LINEAR PROGRAMMING; MIXED-INTEGER PROGRAMMING; MULTI-ITEM; REFORMULATION; SCHEDULING PROBLEM; START-UP COSTS; START-UPS; VALID INEQUALITY;

INTEGER PROGRAMMING; SCHEDULING; STRAIN MEASUREMENT;

BUSINESS MACHINES;

EID: 84857650419     PISSN: 18624472     EISSN: 18624480     Source Type: Journal    
DOI: 10.1007/s11590-011-0280-8     Document Type: Article

References (11)

1. Belvaux G., Wolsey L. A.: Modelling practical lot-sizing problems as mixed-integer programs. Manag. Sci. 47, 993-1007 (2001).
2. Constantino, M.: A polyhedral approach to production planning models: startup costs and times and lower bounds on production. PhD thesis, Université catholique de Louvain, Belgique (1995).
3. Eppen G. D, Martin R. K.: Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35, 832-848 (1987).
4. Gicquel, C., Minoux, M., Dallery, Y.: A tight MIP formulation for the discrete lot sizing and scheduling problem with parallel resources, International Conference on Computers and Industrial Engineering. Université Technologique de Troyes, Troyes, France (2009).
5. Jans R., Degraeve Z.: An industrial extension of the discrete lot-sizing and scheduling problem. IIE Trans. 36, 47-58 (2004).
6. Lasdon L. S.: Optimization theory for large systems. Macmillan, New York (1970).
7. Lasdon L. S., Terjung R. C.: An efficient algorithm for multi-item scheduling. Oper. Res. 19, 946-969 (1971).
8. Salomon M., Solomon M., van Wassenhove L. N., Dumas Y., Dauzère-Peres S.: Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. Eur. J. Oper. Res. 100, 494-513 (1997).
9. Vanderbeck F., Wolsey L. A.: Valid inequalities for the Lasdon-Terjung production model. J. Oper. Res. Soc. 43, 435-441 (1992).
10. van Eijl C. A., van Hoesel C. P. M.: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Oper. Res. Lett. 20, 7-13 (1997).
11. van Hoesel C. P. M., Kolen A.: A linear description of the discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 75, 342-353 (1994).