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

F.T.S. Chan, T.C. Wong, L.Y. Chan

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

2 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.
LanguageEnglish
Title of host publication2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008
PublisherIEEE
Pages331-335
Number of pages5
ISBN (Print)9781424426294
DOIs
Publication statusPublished - 1 Jan 2008
EventIEEM 2008. IEEE International Conference on Industrial Engineering and Engineering Management - Singapore, Singapore
Duration: 8 Dec 200811 Dec 2008

Conference

ConferenceIEEM 2008. IEEE International Conference on Industrial Engineering and Engineering Management
CountrySingapore
CitySingapore
Period8/12/0811/12/08

Fingerprint

Genetic algorithms
Particle swarm optimization (PSO)
Job shop scheduling
Costs
Scheduling

Keywords

  • job shop scheduling
  • particle swarm optimisation
  • genetic algorithms
  • assembly systems
  • bills of materials
  • costs
  • genetic alogrithms
  • lot streaming
  • assembly job shop

Cite this

Chan, F. T. S., Wong, T. C., & 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 (pp. 331-335). IEEE. https://doi.org/10.1109/IEEM.2008.4737885
Chan, F.T.S. ; Wong, T.C. ; Chan, L.Y. / A Genetic algorithm-based approach to job shop scheduling problem with assembly stage. 2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008. IEEE, 2008. pp. 331-335
@inproceedings{87fa32f78b4d4cc4b68335453df790f9,
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 = "job shop scheduling , particle swarm optimisation, genetic algorithms, assembly systems, bills of materials, costs, genetic alogrithms, lot streaming, assembly job shop",
author = "F.T.S. Chan and T.C. Wong and L.Y. Chan",
year = "2008",
month = "1",
day = "1",
doi = "10.1109/IEEM.2008.4737885",
language = "English",
isbn = "9781424426294",
pages = "331--335",
booktitle = "2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008",
publisher = "IEEE",

}

Chan, FTS, 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. IEEE, pp. 331-335, IEEM 2008. IEEE International Conference on Industrial Engineering and Engineering Management, 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, F.T.S.; Wong, T.C.; Chan, L.Y.

2008 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2008. IEEE, 2008. p. 331-335.

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

TY - GEN

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

AU - Chan, F.T.S.

AU - Wong, T.C.

AU - Chan, L.Y.

PY - 2008/1/1

Y1 - 2008/1/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 - job shop scheduling

KW - particle swarm optimisation

KW - genetic algorithms

KW - assembly systems

KW - bills of materials

KW - costs

KW - genetic alogrithms

KW - lot streaming

KW - assembly job shop

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 contribution book

SN - 9781424426294

SP - 331

EP - 335

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

PB - IEEE

ER -

Chan FTS, Wong TC, Chan LY. 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. 2008. p. 331-335 https://doi.org/10.1109/IEEM.2008.4737885