An application of genetic algorithms to lot-streaming flow shop scheduling

Suk Hun Yoon, Jose Antonio Ventura

Research output: Contribution to journalArticle

73 Citations (Scopus)

Abstract

A Hybrid Genetic Algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion times from due dates. This performance criterion has been shown to be nonregular and requires a search among schedules with intermittent idle times to find an optimal solution. For a given job sequence, a Linear Programming (LP) formulation is presented to obtain optimal sublot completion times. Objective function values of LP solutions are used to guide the HGA's search toward the best sequence. The performance of the HGA approach is compared with that of a pairwise interchange method.

Original languageEnglish (US)
Pages (from-to)779-787
Number of pages9
JournalIIE Transactions (Institute of Industrial Engineers)
Volume34
Issue number9
DOIs
StatePublished - Jan 1 2002

Fingerprint

Linear programming
Genetic algorithms
Scheduling
Interchanges

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

@article{9df6eca2abda4930a197da76b315cbfb,
title = "An application of genetic algorithms to lot-streaming flow shop scheduling",
abstract = "A Hybrid Genetic Algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion times from due dates. This performance criterion has been shown to be nonregular and requires a search among schedules with intermittent idle times to find an optimal solution. For a given job sequence, a Linear Programming (LP) formulation is presented to obtain optimal sublot completion times. Objective function values of LP solutions are used to guide the HGA's search toward the best sequence. The performance of the HGA approach is compared with that of a pairwise interchange method.",
author = "Yoon, {Suk Hun} and Ventura, {Jose Antonio}",
year = "2002",
month = "1",
day = "1",
doi = "10.1023/A:1015596621196",
language = "English (US)",
volume = "34",
pages = "779--787",
journal = "IISE Transactions",
issn = "2472-5854",
publisher = "Taylor and Francis Ltd.",
number = "9",

}

An application of genetic algorithms to lot-streaming flow shop scheduling. / Yoon, Suk Hun; Ventura, Jose Antonio.

In: IIE Transactions (Institute of Industrial Engineers), Vol. 34, No. 9, 01.01.2002, p. 779-787.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An application of genetic algorithms to lot-streaming flow shop scheduling

AU - Yoon, Suk Hun

AU - Ventura, Jose Antonio

PY - 2002/1/1

Y1 - 2002/1/1

N2 - A Hybrid Genetic Algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion times from due dates. This performance criterion has been shown to be nonregular and requires a search among schedules with intermittent idle times to find an optimal solution. For a given job sequence, a Linear Programming (LP) formulation is presented to obtain optimal sublot completion times. Objective function values of LP solutions are used to guide the HGA's search toward the best sequence. The performance of the HGA approach is compared with that of a pairwise interchange method.

AB - A Hybrid Genetic Algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion times from due dates. This performance criterion has been shown to be nonregular and requires a search among schedules with intermittent idle times to find an optimal solution. For a given job sequence, a Linear Programming (LP) formulation is presented to obtain optimal sublot completion times. Objective function values of LP solutions are used to guide the HGA's search toward the best sequence. The performance of the HGA approach is compared with that of a pairwise interchange method.

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

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

U2 - 10.1023/A:1015596621196

DO - 10.1023/A:1015596621196

M3 - Article

VL - 34

SP - 779

EP - 787

JO - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 9

ER -