A scheduling problem in a semi-open job shop-the case of a cordset manufacturing company

A. S. Alfa; K. L. Dolhun; Chung Lun Li

doi:10.1016/0895-7177(94)90201-1

A scheduling problem in a semi-open job shop-the case of a cordset manufacturing company

A. S. Alfa
, K. L. Dolhun
, Chung Lun Li

Research output: Journal article publication › Journal article › Academic research › peer-review

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	https://doi.org/10.1016/0895-7177(94)90201-1
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

More information

10.1016/0895-7177(94)90201-1

Cite this

@article{6d0ca33c9d3b43a0b8a9a53af521dc69,

title = "A scheduling problem in a semi-open job shop-the case of a cordset manufacturing company",

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.",

keywords = "Scheduling, Semi-open job shop, Sequencing",

author = "Alfa, \{A. S.\} and Dolhun, \{K. L.\} and Li, \{Chung Lun\}",

year = "1994",

month = jan,

day = "1",

doi = "10.1016/0895-7177(94)90201-1",

language = "English",

volume = "20",

pages = "1--8",

journal = "Mathematical and Computer Modelling",

issn = "0895-7177",

publisher = "Elsevier Ltd",

number = "2",

}

TY - JOUR

T1 - A scheduling problem in a semi-open job shop-the case of a cordset manufacturing company

AU - Alfa, A. S.

AU - Dolhun, K. L.

AU - Li, Chung Lun

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

KW - Scheduling

KW - Semi-open job shop

KW - Sequencing

UR - https://www.scopus.com/pages/publications/43949150966

U2 - 10.1016/0895-7177(94)90201-1

DO - 10.1016/0895-7177(94)90201-1

M3 - Journal article

SN - 0895-7177

VL - 20

SP - 1

EP - 8

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

IS - 2

ER -

A scheduling problem in a semi-open job shop-the case of a cordset manufacturing company

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this