A SCHEDULING PROBLEM IN A SEMIOPEN JOB-SHOP - THE CASE OF A CORDSET MANUFACTURING COMPANY

Authors
ALFA AS DOLHUN KL LI CL
Citation
As. Alfa et al., A SCHEDULING PROBLEM IN A SEMIOPEN JOB-SHOP - THE CASE OF A CORDSET MANUFACTURING COMPANY, Mathematical and computer modelling, 20(2), 1994, pp. 1-8
Citations number
2
Categorie Soggetti
Mathematics,Mathematics,"Computer Science Interdisciplinary Applications","Computer Science Software Graphycs Programming
Journal title
Mathematical and computer modelling → ACNP
ISSN journal
08957177
Volume
20
Issue
2
Year of publication
1994
Pages
1 - 8
Database
ISI
SICI code
0895-7177(1994)20:2<1:ASPIAS>2.0.ZU;2-C
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 s equenced in a semi-flexible manner. We present a mixed-integer program ming formulation of this problem. Heuristic algorithms are presented f or solving this problem.