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

Chan, Felix T S and Wong, T. C. and Chan, P. L Y; (2008) The application of lot streaming to assembly job shop under resource constraints. In: IFAC Proceedings Volumes (IFAC-PapersOnline). International Federation of Automatic Control (IFAC), PRK. ISBN 9783902661005 (https://doi.org/10.3182/20080706-5-KR-1001.1142)

Full text not available in this repository.Request a copy

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.

ORCID iDs

Chan, Felix T S, Wong, T. C. ORCID logoORCID: https://orcid.org/0000-0001-8942-1984 and Chan, P. L Y;
CORE (COnnecting REpositories)