Abstract
This paper addresses the problem of scheduling of a set of N jobs through M machines in a job shop environment that involves both machining and assembly operations. Each job is an assembly of component and subassembly parts. The problem is modeled as a mathematical program to obtain a minimum production time schedule. A heuristic algorithm is also developed for solving large size problems that may involve high computational time if an exact solution procedure is used.
Original language | English (US) |
---|---|
Pages | 432-437 |
Number of pages | 6 |
State | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 6th Annual Industrial Engineering Research Conference, IERC - Miami Beach, FL, USA Duration: May 17 1997 → May 18 1997 |
Other
Other | Proceedings of the 1997 6th Annual Industrial Engineering Research Conference, IERC |
---|---|
City | Miami Beach, FL, USA |
Period | 5/17/97 → 5/18/97 |
All Science Journal Classification (ASJC) codes
- Industrial and Manufacturing Engineering