Skip to main content

Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem

Publication ,  Journal Article
Zipkin, PH
Published in: Operations Research
February 1991

This paper treats a version of the Economic Lot Scheduling Problem (ELSP) in which items may be produced several times in different amounts during a cycle. We show how to compute the optimal lot sizes and cycle length, given the sequence of items in a cycle. This requires solving a parametric quadratic program, plus a few EOQ calculations. Our procedure is designed to be used along with a heuristic for selecting the sequence of items in a cycle, such as the one proposed in 1987 by G. Dobson. The two algorithms together comprise a simple, plausible heuristic for the ELSP as a whole.

Duke Scholars

Published In

Operations Research

DOI

EISSN

1526-5463

ISSN

0030-364X

Publication Date

February 1991

Volume

39

Issue

1

Start / End Page

56 / 63

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related Subject Headings

  • Operations Research
  • 3507 Strategy, management and organisational behaviour
  • 1503 Business and Management
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Zipkin, P. H. (1991). Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem. Operations Research, 39(1), 56–63. https://doi.org/10.1287/opre.39.1.56
Zipkin, Paul H. “Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem.” Operations Research 39, no. 1 (February 1991): 56–63. https://doi.org/10.1287/opre.39.1.56.
Zipkin PH. Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem. Operations Research. 1991 Feb;39(1):56–63.
Zipkin, Paul H. “Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem.” Operations Research, vol. 39, no. 1, Institute for Operations Research and the Management Sciences (INFORMS), Feb. 1991, pp. 56–63. Crossref, doi:10.1287/opre.39.1.56.
Zipkin PH. Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem. Operations Research. Institute for Operations Research and the Management Sciences (INFORMS); 1991 Feb;39(1):56–63.

Published In

Operations Research

DOI

EISSN

1526-5463

ISSN

0030-364X

Publication Date

February 1991

Volume

39

Issue

1

Start / End Page

56 / 63

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related Subject Headings

  • Operations Research
  • 3507 Strategy, management and organisational behaviour
  • 1503 Business and Management
  • 0802 Computation Theory and Mathematics
  • 0102 Applied Mathematics