Abstract
This paper addresses the problem of determining time-optimal resource allocation schedules for re-entrant semiconductor manufacturing lines. More specifically, a solution is presented for the problem of determining a product (start) release schedule and machine work schedules such that the buffer levels are driven from a given initial state to a final desired state in minimum time. The development is based upon widely used flow models. Algorithms are presented for determining the optimal reachability time and an admissible time-optimal scheduling policy.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the IEEE Conference on Decision and Control |
Publisher | IEEE |
Pages | 102-107 |
Number of pages | 6 |
Volume | 1 |
State | Published - 1997 |
Event | Proceedings of the 1997 36th IEEE Conference on Decision and Control. Part 1 (of 5) - San Diego, CA, USA Duration: Dec 10 1997 → Dec 12 1997 |
Other
Other | Proceedings of the 1997 36th IEEE Conference on Decision and Control. Part 1 (of 5) |
---|---|
City | San Diego, CA, USA |
Period | 12/10/97 → 12/12/97 |
ASJC Scopus subject areas
- Chemical Health and Safety
- Control and Systems Engineering
- Safety, Risk, Reliability and Quality