A Genetic algorithm-based approach to job shop scheduling problem with assembly stage

Tung Sun Chan; T. C. Wong; L. Y. Chan

doi:10.1109/IEEM.2008.4737885

A Genetic algorithm-based approach to job shop scheduling problem with assembly stage

Tung Sun Chan, T. C. Wong, L. Y. Chan

The Hong Kong Polytechnic University

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

3 Citations (Scopus)

Abstract

Assembly job shop scheduling problem (AJSSP) is an extension of classical job shop scheduling problem (JSSP). AJSSP first starts with a JSSP and appends an assembly stage after job completion. In this paper, we extend Lot Streaming (LS) to AJSSP. Hence, the problem is divided into SP1: the determination of LS conditions for all lots and SP2: the scheduling of AJSSP after LS conditions have been determined. To solve the problem, we propose an innovative Genetic Algorithm (GA) approach. To investigate the impacts of LS on AJSSP, several system conditions are examined. To justify the GA, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that equal size LS is the best strategy and GA outperforms PSO for all test problems. Some negative impacts of LS are the increase of work-in-process inventory and total setup cost if the objective is the minimization of total lateness cost.

Original language	English
Title of host publication	2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008
Pages	331-335
Number of pages	5
DOIs	https://doi.org/10.1109/IEEM.2008.4737885
Publication status	Published - 1 Dec 2008
Event	2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008 - Singapore, Singapore Duration: 8 Dec 2008 → 11 Dec 2008

Conference

Conference	2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008
Country/Territory	Singapore
City	Singapore
Period	8/12/08 → 11/12/08

Keywords

Assembly job shop
Genetic algorithm
Lot streaming
Particle Swarm Optimization

ASJC Scopus subject areas

Management Information Systems
Industrial and Manufacturing Engineering

More information

10.1109/IEEM.2008.4737885

Cite this

@inproceedings{6b6ff31c68a34453b070bf2ca70eebb0,

title = "A Genetic algorithm-based approach to job shop scheduling problem with assembly stage",

abstract = "Assembly job shop scheduling problem (AJSSP) is an extension of classical job shop scheduling problem (JSSP). AJSSP first starts with a JSSP and appends an assembly stage after job completion. In this paper, we extend Lot Streaming (LS) to AJSSP. Hence, the problem is divided into SP1: the determination of LS conditions for all lots and SP2: the scheduling of AJSSP after LS conditions have been determined. To solve the problem, we propose an innovative Genetic Algorithm (GA) approach. To investigate the impacts of LS on AJSSP, several system conditions are examined. To justify the GA, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that equal size LS is the best strategy and GA outperforms PSO for all test problems. Some negative impacts of LS are the increase of work-in-process inventory and total setup cost if the objective is the minimization of total lateness cost.",

keywords = "Assembly job shop, Genetic algorithm, Lot streaming, Particle Swarm Optimization",

author = "Chan, {Tung Sun} and Wong, {T. C.} and Chan, {L. Y.}",

year = "2008",

month = dec,

day = "1",

doi = "10.1109/IEEM.2008.4737885",

language = "English",

isbn = "9781424426300",

pages = "331--335",

booktitle = "2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008",

note = "2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008 ; Conference date: 08-12-2008 Through 11-12-2008",

}

Chan, TS, Wong, TC & Chan, LY 2008, A Genetic algorithm-based approach to job shop scheduling problem with assembly stage. in 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008., 4737885, pp. 331-335, 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008, Singapore, Singapore, 8/12/08. https://doi.org/10.1109/IEEM.2008.4737885

A Genetic algorithm-based approach to job shop scheduling problem with assembly stage. / Chan, Tung Sun; Wong, T. C.; Chan, L. Y.
2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008. 2008. p. 331-335 4737885.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - A Genetic algorithm-based approach to job shop scheduling problem with assembly stage

AU - Chan, Tung Sun

AU - Wong, T. C.

AU - Chan, L. Y.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Assembly job shop scheduling problem (AJSSP) is an extension of classical job shop scheduling problem (JSSP). AJSSP first starts with a JSSP and appends an assembly stage after job completion. In this paper, we extend Lot Streaming (LS) to AJSSP. Hence, the problem is divided into SP1: the determination of LS conditions for all lots and SP2: the scheduling of AJSSP after LS conditions have been determined. To solve the problem, we propose an innovative Genetic Algorithm (GA) approach. To investigate the impacts of LS on AJSSP, several system conditions are examined. To justify the GA, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that equal size LS is the best strategy and GA outperforms PSO for all test problems. Some negative impacts of LS are the increase of work-in-process inventory and total setup cost if the objective is the minimization of total lateness cost.

AB - Assembly job shop scheduling problem (AJSSP) is an extension of classical job shop scheduling problem (JSSP). AJSSP first starts with a JSSP and appends an assembly stage after job completion. In this paper, we extend Lot Streaming (LS) to AJSSP. Hence, the problem is divided into SP1: the determination of LS conditions for all lots and SP2: the scheduling of AJSSP after LS conditions have been determined. To solve the problem, we propose an innovative Genetic Algorithm (GA) approach. To investigate the impacts of LS on AJSSP, several system conditions are examined. To justify the GA, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that equal size LS is the best strategy and GA outperforms PSO for all test problems. Some negative impacts of LS are the increase of work-in-process inventory and total setup cost if the objective is the minimization of total lateness cost.

KW - Assembly job shop

KW - Genetic algorithm

KW - Lot streaming

KW - Particle Swarm Optimization

UR - http://www.scopus.com/inward/record.url?scp=62749159012&partnerID=8YFLogxK

U2 - 10.1109/IEEM.2008.4737885

DO - 10.1109/IEEM.2008.4737885

M3 - Conference article published in proceeding or book

SN - 9781424426300

SP - 331

EP - 335

BT - 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008

T2 - 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008

Y2 - 8 December 2008 through 11 December 2008

ER -

A Genetic algorithm-based approach to job shop scheduling problem with assembly stage

Abstract

Conference

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this