The application of lot streaming to assembly job shop under resource constraints

Felix T S Chan, T. C. Wong, P. L Y Chan

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

1 Citation (Scopus)

Abstract

Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP will be extended by introducing resource constraints. To reduce the computational effort, we propose a new Genetic Algorithm (GA) approach which is the modification of the algorithm in our previous paper. A number of test problems are conducted to examine the performance of the new GA approach. Moreover, the single GA approach will be compared with a single Particle Swarm Optimization (PSO) approach. Computational results suggest that the new algorithm can outperform the previous one and the PSO approach with respect to the objective function. 

LanguageEnglish
Title of host publicationIFAC Proceedings Volumes (IFAC-PapersOnline)
Volume17
Edition1 PART 1
DOIs
Publication statusPublished - 1 Dec 2008
Event17th World Congress, International Federation of Automatic Control, IFAC - Seoul, Korea, Democratic People's Republic of
Duration: 6 Jul 200811 Jul 2008

Conference

Conference17th World Congress, International Federation of Automatic Control, IFAC
CountryKorea, Democratic People's Republic of
CitySeoul
Period6/07/0811/07/08

Fingerprint

Genetic algorithms
Particle swarm optimization (PSO)

Keywords

  • assembly and disassembly
  • job and activity scheduling
  • manufacturing plant control

Cite this

Chan, F. T. S., Wong, T. C., & Chan, P. L. Y. (2008). The application of lot streaming to assembly job shop under resource constraints. In IFAC Proceedings Volumes (IFAC-PapersOnline) (1 PART 1 ed., Vol. 17) https://doi.org/10.3182/20080706-5-KR-1001.1142
Chan, Felix T S ; Wong, T. C. ; Chan, P. L Y. / The application of lot streaming to assembly job shop under resource constraints. IFAC Proceedings Volumes (IFAC-PapersOnline). Vol. 17 1 PART 1. ed. 2008.
@inproceedings{8f1c80e97fa24013b0a7cbbfeb4a6772,
title = "The application of lot streaming to assembly job shop under resource constraints",
abstract = "Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP will be extended by introducing resource constraints. To reduce the computational effort, we propose a new Genetic Algorithm (GA) approach which is the modification of the algorithm in our previous paper. A number of test problems are conducted to examine the performance of the new GA approach. Moreover, the single GA approach will be compared with a single Particle Swarm Optimization (PSO) approach. Computational results suggest that the new algorithm can outperform the previous one and the PSO approach with respect to the objective function. ",
keywords = "assembly and disassembly, job and activity scheduling, manufacturing plant control",
author = "Chan, {Felix T S} and Wong, {T. C.} and Chan, {P. L Y}",
year = "2008",
month = "12",
day = "1",
doi = "10.3182/20080706-5-KR-1001.1142",
language = "English",
isbn = "9783902661005",
volume = "17",
booktitle = "IFAC Proceedings Volumes (IFAC-PapersOnline)",
edition = "1 PART 1",

}

Chan, FTS, Wong, TC & Chan, PLY 2008, The application of lot streaming to assembly job shop under resource constraints. in IFAC Proceedings Volumes (IFAC-PapersOnline). 1 PART 1 edn, vol. 17, 17th World Congress, International Federation of Automatic Control, IFAC, Seoul, Korea, Democratic People's Republic of, 6/07/08. https://doi.org/10.3182/20080706-5-KR-1001.1142

The application of lot streaming to assembly job shop under resource constraints. / Chan, Felix T S; Wong, T. C.; Chan, P. L Y.

IFAC Proceedings Volumes (IFAC-PapersOnline). Vol. 17 1 PART 1. ed. 2008.

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

TY - GEN

T1 - The application of lot streaming to assembly job shop under resource constraints

AU - Chan, Felix T S

AU - Wong, T. C.

AU - Chan, P. L Y

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP will be extended by introducing resource constraints. To reduce the computational effort, we propose a new Genetic Algorithm (GA) approach which is the modification of the algorithm in our previous paper. A number of test problems are conducted to examine the performance of the new GA approach. Moreover, the single GA approach will be compared with a single Particle Swarm Optimization (PSO) approach. Computational results suggest that the new algorithm can outperform the previous one and the PSO approach with respect to the objective function. 

AB - Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP will be extended by introducing resource constraints. To reduce the computational effort, we propose a new Genetic Algorithm (GA) approach which is the modification of the algorithm in our previous paper. A number of test problems are conducted to examine the performance of the new GA approach. Moreover, the single GA approach will be compared with a single Particle Swarm Optimization (PSO) approach. Computational results suggest that the new algorithm can outperform the previous one and the PSO approach with respect to the objective function. 

KW - assembly and disassembly

KW - job and activity scheduling

KW - manufacturing plant control

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

UR - http://www.ifac2008.org/

UR - http://www.ifac-control.org/events/past

U2 - 10.3182/20080706-5-KR-1001.1142

DO - 10.3182/20080706-5-KR-1001.1142

M3 - Conference contribution book

SN - 9783902661005

VL - 17

BT - IFAC Proceedings Volumes (IFAC-PapersOnline)

ER -

Chan FTS, Wong TC, Chan PLY. The application of lot streaming to assembly job shop under resource constraints. In IFAC Proceedings Volumes (IFAC-PapersOnline). 1 PART 1 ed. Vol. 17. 2008 https://doi.org/10.3182/20080706-5-KR-1001.1142