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. 

Original 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

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