Analysis of bounds for a capacitated single-item lot-sizing problem

Jill R. Hardin; George L. Nemhauser; Martin W P Savelsbergh

doi:10.1016/j.cor.2005.05.031

Analysis of bounds for a capacitated single-item lot-sizing problem

Jill R. Hardin^*, George L. Nemhauser, Martin W P Savelsbergh

^*Corresponding author for this work

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.

Original language	English (US)
Pages (from-to)	1721-1743
Number of pages	23
Journal	Computers and Operations Research
Volume	34
Issue number	6 SPEC. ISS.
DOIs	https://doi.org/10.1016/j.cor.2005.05.031
State	Published - Jun 2007

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2005.05.031

Cite this

@article{b3018e8cd8d94cda83b54558c83a4e7b,

title = "Analysis of bounds for a capacitated single-item lot-sizing problem",

abstract = "Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.",

author = "Hardin, {Jill R.} and Nemhauser, {George L.} and Savelsbergh, {Martin W P}",

year = "2007",

month = jun,

doi = "10.1016/j.cor.2005.05.031",

language = "English (US)",

volume = "34",

pages = "1721--1743",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "6 SPEC. ISS.",

}

TY - JOUR

T1 - Analysis of bounds for a capacitated single-item lot-sizing problem

AU - Hardin, Jill R.

AU - Nemhauser, George L.

AU - Savelsbergh, Martin W P

PY - 2007/6

Y1 - 2007/6

N2 - Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.

AB - Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a range of fast algorithms. Special attention is given to LP-based rounding algorithms.

UR - http://www.scopus.com/inward/record.url?scp=33749671280&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749671280&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2005.05.031

DO - 10.1016/j.cor.2005.05.031

M3 - Article

AN - SCOPUS:33749671280

SN - 0305-0548

VL - 34

SP - 1721

EP - 1743

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 6 SPEC. ISS.

ER -

Analysis of bounds for a capacitated single-item lot-sizing problem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this