The application of genetic algorithms to lot streaming in a job-shop scheduling problem

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

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

A new approach using genetic algorithms (GAs) is proposed to determine lot streaming (LS) conditions in a job-shop scheduling problem (JSP). LS refers to a situation that a job (lot) can be split into a number of smaller jobs (sub-lots) so that successive operations of the same job can be overlapped. Consequently, the completion time of the whole job can be shortened. By applying the proposed approach called LSGAVS, two sub-problems are solved simultaneously using GAs. The first problem is called the LS problem in which the LS conditions are determined and the second problem is called JSP after the LS conditions have been determined. Based on timeliness approach, a number of test problems will be studied to investigate the optimum the LS conditions such that all jobs can be finished close to their due dates in a job-shop environment. Computational results suggest that the proposed model, LSGAVS, works well with different objective measures and good solutions can be obtained with reasonable computational effort.
LanguageEnglish
Pages3387-3412
Number of pages26
JournalInternational Journal of Production Research
Volume47
Issue number12
DOIs
Publication statusPublished - 1 Jan 2009

Fingerprint

Genetic algorithms
Job shop scheduling
Lot streaming
Genetic algorithm

Keywords

  • genetic algorithms
  • lot streaming
  • job-shop scheduling

Cite this

@article{c33211ef71934debadc5e21ae22a4937,
title = "The application of genetic algorithms to lot streaming in a job-shop scheduling problem",
abstract = "A new approach using genetic algorithms (GAs) is proposed to determine lot streaming (LS) conditions in a job-shop scheduling problem (JSP). LS refers to a situation that a job (lot) can be split into a number of smaller jobs (sub-lots) so that successive operations of the same job can be overlapped. Consequently, the completion time of the whole job can be shortened. By applying the proposed approach called LSGAVS, two sub-problems are solved simultaneously using GAs. The first problem is called the LS problem in which the LS conditions are determined and the second problem is called JSP after the LS conditions have been determined. Based on timeliness approach, a number of test problems will be studied to investigate the optimum the LS conditions such that all jobs can be finished close to their due dates in a job-shop environment. Computational results suggest that the proposed model, LSGAVS, works well with different objective measures and good solutions can be obtained with reasonable computational effort.",
keywords = "genetic algorithms, lot streaming, job-shop scheduling",
author = "F.T.S. Chan and T.C. Wong and L.Y. Chan",
year = "2009",
month = "1",
day = "1",
doi = "10.1080/00207540701577369",
language = "English",
volume = "47",
pages = "3387--3412",
journal = "International Journal of Production Research",
issn = "0020-7543",
number = "12",

}

The application of genetic algorithms to lot streaming in a job-shop scheduling problem. / Chan, F.T.S.; Wong, T.C.; Chan, L.Y.

In: International Journal of Production Research, Vol. 47, No. 12, 01.01.2009, p. 3387-3412.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The application of genetic algorithms to lot streaming in a job-shop scheduling problem

AU - Chan, F.T.S.

AU - Wong, T.C.

AU - Chan, L.Y.

PY - 2009/1/1

Y1 - 2009/1/1

N2 - A new approach using genetic algorithms (GAs) is proposed to determine lot streaming (LS) conditions in a job-shop scheduling problem (JSP). LS refers to a situation that a job (lot) can be split into a number of smaller jobs (sub-lots) so that successive operations of the same job can be overlapped. Consequently, the completion time of the whole job can be shortened. By applying the proposed approach called LSGAVS, two sub-problems are solved simultaneously using GAs. The first problem is called the LS problem in which the LS conditions are determined and the second problem is called JSP after the LS conditions have been determined. Based on timeliness approach, a number of test problems will be studied to investigate the optimum the LS conditions such that all jobs can be finished close to their due dates in a job-shop environment. Computational results suggest that the proposed model, LSGAVS, works well with different objective measures and good solutions can be obtained with reasonable computational effort.

AB - A new approach using genetic algorithms (GAs) is proposed to determine lot streaming (LS) conditions in a job-shop scheduling problem (JSP). LS refers to a situation that a job (lot) can be split into a number of smaller jobs (sub-lots) so that successive operations of the same job can be overlapped. Consequently, the completion time of the whole job can be shortened. By applying the proposed approach called LSGAVS, two sub-problems are solved simultaneously using GAs. The first problem is called the LS problem in which the LS conditions are determined and the second problem is called JSP after the LS conditions have been determined. Based on timeliness approach, a number of test problems will be studied to investigate the optimum the LS conditions such that all jobs can be finished close to their due dates in a job-shop environment. Computational results suggest that the proposed model, LSGAVS, works well with different objective measures and good solutions can be obtained with reasonable computational effort.

KW - genetic algorithms

KW - lot streaming

KW - job-shop scheduling

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

U2 - 10.1080/00207540701577369

DO - 10.1080/00207540701577369

M3 - Article

VL - 47

SP - 3387

EP - 3412

JO - International Journal of Production Research

T2 - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 12

ER -