A discounted-cost continuous-time flexible manufacturing and operator scheduling model solved by deconvexification over time
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.
- Research Organization:
- Stanford Univ., CA (USA). Systems Optimization Lab.
- Sponsoring Organization:
- USDOD; DOE/ER; National Science Foundation (NSF)
- DOE Contract Number:
- FG03-87ER25028
- OSTI ID:
- 6445957
- Report Number(s):
- SOL-90-15; ON: DE91001359; CNN: DMS-8902662
- Country of Publication:
- United States
- Language:
- English
Similar Records
A flexible manufacturing and operator scheduling model solved by deconvexification over time
Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks