Solution Method for a Class of Stochastic Scheduling Problems for the Production of a Single Commodity

Gifford H. Symonds
Additional contact information
Gifford H. Symonds: University of California, Berkeley, California

Operations Research, 1971, vol. 19, issue 6, 1459-1466

Abstract: This paper expresses a solution method for a fairly general class of stochastic scheduling problems for the production of a single nonperishable commodity as a set of differences between the optimal partial differential equations in successive periods. It shows that the recursive stochastic scheduling equation, which is independent of subsequent values, allows an entire stochastic schedule to be generated from an initial inventory x 0 and production z 1 to meet a set of demand variables s 1 , …, s n to an extent indicated by F 1 ( y 1 ), …, F n ( y n ). An optimal value of z 1 is the minimal value that produces a feasible schedule. After the actual inventory x j −1 becomes available each period, then a new stochastic schedule can be prepared for the current optimal value of z j .

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.6.1459 (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:6:p:1459-1466

Access Statistics for this article

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