A Discrete Time Average Cost Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time

B. Curtis Eaves and Uriel G. Rothblum
Additional contact information
B. Curtis Eaves: Stanford University, Stanford, California
Uriel G. Rothblum: Technion-Israel Institute of Technology, Haifa, Israel

Operations Research, 1988, vol. 36, issue 2, 242-257

Abstract: A flexible manufacturing and operator scheduling problem is introduced and solved. The principal concern is to schedule operators over time to various activities of a manufacturing system for the purpose of optimizing some steady-state criteria. In mathematical terms, the problem is modeled as a deterministic, infinite horizon, discrete dynamic program. Our solution procedure is to convexify the problem to obtain a linear program, and then to deconvexify the solution of the linear program over time to arrive at an optimal solution. Apparent loss in objective value due to the deconvexifications is circumvented with buffer inventories. The procedure is reduced to solving a sequence of linear programs and the complexity is stated in these terms.

Keywords: 581 flexible manufacturing; operator scheduling (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.2.242 (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:36:y:1988:i:2:p:242-257

Access Statistics for this article

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