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

Chan, F.T.S. and Wong, T.C. and Chan, L.Y.; (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. IEEE, SGP, pp. 331-335. ISBN 9781424426294 (https://doi.org/10.1109/IEEM.2008.4737885)

Full text not available in this repository.Request a copy

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.

ORCID iDs

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