Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1-8 |
Number of pages | 8 |
Journal | Mathematical and Computer Modelling |
Volume | 20 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Jan 1994 |
Externally published | Yes |
Keywords
- Scheduling
- Semi-open job shop
- Sequencing
ASJC Scopus subject areas
- Modelling and Simulation
- Computer Science Applications