A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility

Bezalel Gavish and Robert E. Johnson
Additional contact information
Bezalel Gavish: Vanderbilt University, Nashville, Tennessee
Robert E. Johnson: Pennsylvania State University, University Park, Pennsylvania

Operations Research, 1990, vol. 38, issue 1, 70-83

Abstract: This paper considers a version of the economic lot sizing problem for a single product produced in a facility of finite capacity over a finite time horizon with specifiable start and end conditions. A set of algorithms is presented that will approximate the optimal production schedule to a given allowable error (ε). Algorithms with computation time bounds of O (1/ε 2 ) are presented which allow for setups of finite length, setups with or without direct cash flow, quite general cost and demand functions, and a wide variety of production policy constraints. The procedures make no a priori assumptions about the form of the optimal solution. Numerical results are included.

Keywords: production/scheduling:; lot; sizing; approximations; and; production; planning (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.1.70 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:1:p:70-83

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().