Hostname: page-component-76fb5796d-qxdb6 Total loading time: 0 Render date: 2024-04-26T08:38:46.894Z Has data issue: false hasContentIssue false
  • English
  • Français

A Discounted-Cost Continuous-Time Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time*

Published online by Cambridge University Press:  27 July 2009

B. Curtis Eaves  and
Uriel G. Rothblum
B. Curtis Eaves
Affiliation:
Faculty of Industrial Engineering and Management, Technion-lsrael Institute of Technology, Haifa 32000, Israel
Uriel G. Rothblum
Affiliation:
Faculty of Industrial Engineering and Management, Technion-lsrael Institute of Technology, Haifa 32000, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

A discounted-cost, continuous-time, infinite-horizon version of a flexible manufacturing and operator scheduling model is solved. The solution procedure is to convexify the discrete operator-assignment constraints to obtain a linear program and then to regain the discreteness and obtain an approximate manufacturing schedule by deconvexification of the solution of the linear program over time. The strong features of the model are the accommodation of linear inequality relations among the manufacturing activities and the discrete manufacturing scheduling, whereas the weak features are intra-period relaxation of inventory availability constraints and the absence of inventory costs, setup times, and setup charges.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 9 , Issue 1 , January 1995 , pp. 65 - 98
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Anstreicher, K.M. (1983). Generation of feasible descent directions in continuous time linear programming. Technical Report SOL 83–18, Department of Operations Research, Stanford University, Stanford, CA.Google Scholar
2.Eaves, B.C. & Rothblum, U.G. (1988). A discrete time average cost flexible manufacturing and operator scheduling problem solved by deconvexification over time. Operations Research 36: 242–257.CrossRefGoogle Scholar
3.Eaves, B.C. & Rothblum, U.G. (1989). A continuous-time average-cost flexible manufacturing and operator scheduling model solved by deconvexification over time. Linear Algebra and Its Applications 114/115: 417–428.CrossRefGoogle Scholar
4.Perold, F.P. (1978). Fundamentals of a continuous time simplex method. Technical Report SOL 78–26, Department of Operations Research, Stanford University, Stanford, CA.Google Scholar
5.Anderson, E.J. & Nash, P. (1987). Linear programming in infinite dimensional spaces. New York: Wiley-Interscience.Google Scholar
6.Pulian, M.C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal of Control and Optimization 31: 1558–1577.CrossRefGoogle Scholar