We consider the scheduling of a cordset manufacturing process through several operations. The department is a semi-open job shop. The first and last operations are defined, but the remaining operations can be sequenced in a semi-flexible manner. We present a mixed-integer programming formulation of this problem. Heuristic algorithms are presented for solving this problem.
- Semi-open job shop
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications