Dynamic Linear Programs for Production Scheduling

C. Roger Glassey
Additional contact information
C. Roger Glassey: University of California, Berkeley, California

Operations Research, 1971, vol. 19, issue 1, 45-56

Abstract: Deterministic linear scheduling problems can often be formulated as linear programs with staircase coefficient matrix structure in which the linking blocks are identity matrices, since the activities that link successive time periods represent storage of goods. The solution technique proposed in this paper can be viewed as a nested decomposition approach in which primal- as well as dual-variable information is transmitter between master and subproblems.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.45 (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:19:y:1971:i:1:p:45-56

Access Statistics for this article

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