The two products-one machine problem solved by Markov programming

T Meewezen

No 293056, University of Amsterdam, Actuarial Science and Econometrics Archive from University of Amsterdam, Faculty of Economics and Business

Abstract: The two products-one machine problem is usually solved under the condition that the production of both products takes place in repetitive cycles. Therefore, the resulting production schedule is not always feasible and it is sometimes possible to determine a better (i.e. cheaper) feasible production schedule. We relax this condition and formulate a dynamic programming model which takes into account the present inventory of both products when it schedules one of the products for production. Furthermore, we indicate how an optimal feasible production schedule can be determined by applying Howard's policy-iteration procedure. Finally, we solve three cases by applying this procedure and we compare the results with production schedules which are obtained by applying three other methods.

Keywords: Research; Methods/Statistical; Methods (search for similar items in EconPapers)
Pages: 32
Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://ageconsearch.umn.edu/record/293056/files/amsterdam032.pdf (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:ags:amstas:293056

DOI: 10.22004/ag.econ.293056

Access Statistics for this paper

More papers in University of Amsterdam, Actuarial Science and Econometrics Archive from University of Amsterdam, Faculty of Economics and Business Contact information at EDIRC.
Bibliographic data for series maintained by AgEcon Search ().