Abstract
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be produced within a given time interval, we derive tight extended formulations for both the constant capacity and uncapacitated problems with Wagner-Whitin (non-speculative) costs. For the variant with nonspecific orders, known to be equivalent to the problem in which the time windows can be ordered by time, we also show equivalence to the basic lot-sizing problem with upper bounds on the stocks. Here we derive polynomial time dynamic programming algorithms and tight extended formulations for the uncapacitated and constant capacity problems with general costs.
For the problem with delivery time windows, we use a similar approach to derive tight extended formulations for both the constant capacity and uncapacitated problems with Wagner-Whitin (non-speculative) costs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atamtürk, A., Küçükyavuz, S.: Lot-sizing with inventory bounds and fixed costs: Oper. Res. 53, 711–730 (2005)
Brahimi, N., Dauzère-Pérès, S., Najid, N.M.: Capacitated multi-item lot-sizing problems with time windows. Technical report, Ecole des Mines de Nantes, 2005
Brahimi, N.: Planification de la production: modèles et algorithmes pour les problemes de dimensionnement de lots. PhD thesis, Université de Nantes, 2004
Cezik, T., Günlük, O.: Reformulating linear programs with transportation constraints – with applications to work-force scheduling. Nav. Res. Logist. Q. 51, 258–274 (2004)
Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: P.B. Mirchandani, R.L. Francis, (eds.), Discrete Location Theory, Wiley, 1990, pp. 119–171
Dauzère-Pérès, S., Brahimi, N., Najid, N.M., Nordli, A.: Uncapacitated lot-sizing problems with time windows. Technical report, Ecole des Mines de Saint-Etienne, 2005
Eppen, G.D., Martin, R.K.: Solving multi-item lot-sizing problems using variable definition. Oper. Res. 35, 832–848 (1987)
Günlük, O., Pochet, Y.: Mixing mixed integer inequalities. Math. Program. 90, 429–457 (2001)
Lee, C.-Y., Cetinkaya, S., Wagelmans, A.P.M.: A dynamic lot-sizing model with demand time windows. Manage. Sci. 47, 1384–1395 (2001)
Love, S.F.: Bounded production and inventory models with piecewise concave costs. Manage. Sci. 20, 313–318 (1973)
Miller, A., Wolsey, L.A.: Tight formulations for some simple MIPs and convex objective IPs. Math. Program. B 98, 73–88 (2003)
Ortega, F.: Formulations and algorithms for fixed charge networks and lot-sizing problems. PhD thesis, Université Catholique de Louvain, 2001
Pochet, Y., Wolsey, L.A.: Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. 18, 767–785 (1993)
Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67, 297–324 (1994)
Author information
Authors and Affiliations
Additional information
We are most grateful for the hospitality of IASI, Rome, where part of this work was carried out. The collaboration with IASI takes place in the framework of ADONET, a European network in Algorithmic Discrete Optimization, contract n MRTN-CT-2003-504438. This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The scientific responsibility is assumed by the authors.
Rights and permissions
About this article
Cite this article
Wolsey, L. Lot-sizing with production and delivery time windows. Math. Program. 107, 471–489 (2006). https://doi.org/10.1007/s10107-005-0675-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0675-3