Comparison of scheduling efficiency in two/three-machine no-wait flow shop problem using simulated annealing and genetic algorithm

Tai Yue Wang, Yih Hwang Yang, Hern Jiang Lin

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper considers two/three-machine no-wait flow shop scheduling problems with makespan minimization. Inherited with the NP-hard problem nature, this scheduling problem is solved by using a Simulated Annealing (SA) and Genetic Algorithm (GA) instead of mathematical programming. These two well-known search algorithms are often used to solve complex combinational optimization problems. In order to compare the performance of the two algorithms, we use solution quality (under the same computational time) and computation efficiency (under the same solution quality) as the measuring criteria. From the example problem, we found that SA is superior to GA in both solution quality and computation efficiency under identical terminating conditions. The performance of SA and GA decreased upon increasing the number of jobs. Our main contributions are to compare SA and GA under limited resources, which would be more consistent with the real world.

Original languageEnglish
Pages (from-to)41-59
Number of pages19
JournalAsia-Pacific Journal of Operational Research
Volume23
Issue number1
DOIs
Publication statusPublished - 2006 Mar 1

Fingerprint

No-wait
Simulated annealing algorithm
Genetic algorithm
Flow shop
Mathematical programming
Flow shop scheduling
Resources
Simulated annealing
Makespan
NP-hard
Nature
Optimization problem

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research

Cite this

@article{6adc50e1869e4c8991176159e364f57c,
title = "Comparison of scheduling efficiency in two/three-machine no-wait flow shop problem using simulated annealing and genetic algorithm",
abstract = "This paper considers two/three-machine no-wait flow shop scheduling problems with makespan minimization. Inherited with the NP-hard problem nature, this scheduling problem is solved by using a Simulated Annealing (SA) and Genetic Algorithm (GA) instead of mathematical programming. These two well-known search algorithms are often used to solve complex combinational optimization problems. In order to compare the performance of the two algorithms, we use solution quality (under the same computational time) and computation efficiency (under the same solution quality) as the measuring criteria. From the example problem, we found that SA is superior to GA in both solution quality and computation efficiency under identical terminating conditions. The performance of SA and GA decreased upon increasing the number of jobs. Our main contributions are to compare SA and GA under limited resources, which would be more consistent with the real world.",
author = "Wang, {Tai Yue} and Yang, {Yih Hwang} and Lin, {Hern Jiang}",
year = "2006",
month = "3",
day = "1",
doi = "10.1142/S0217595906000802",
language = "English",
volume = "23",
pages = "41--59",
journal = "Asia-Pacific Journal of Operational Research",
issn = "0217-5959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

Comparison of scheduling efficiency in two/three-machine no-wait flow shop problem using simulated annealing and genetic algorithm. / Wang, Tai Yue; Yang, Yih Hwang; Lin, Hern Jiang.

In: Asia-Pacific Journal of Operational Research, Vol. 23, No. 1, 01.03.2006, p. 41-59.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Comparison of scheduling efficiency in two/three-machine no-wait flow shop problem using simulated annealing and genetic algorithm

AU - Wang, Tai Yue

AU - Yang, Yih Hwang

AU - Lin, Hern Jiang

PY - 2006/3/1

Y1 - 2006/3/1

N2 - This paper considers two/three-machine no-wait flow shop scheduling problems with makespan minimization. Inherited with the NP-hard problem nature, this scheduling problem is solved by using a Simulated Annealing (SA) and Genetic Algorithm (GA) instead of mathematical programming. These two well-known search algorithms are often used to solve complex combinational optimization problems. In order to compare the performance of the two algorithms, we use solution quality (under the same computational time) and computation efficiency (under the same solution quality) as the measuring criteria. From the example problem, we found that SA is superior to GA in both solution quality and computation efficiency under identical terminating conditions. The performance of SA and GA decreased upon increasing the number of jobs. Our main contributions are to compare SA and GA under limited resources, which would be more consistent with the real world.

AB - This paper considers two/three-machine no-wait flow shop scheduling problems with makespan minimization. Inherited with the NP-hard problem nature, this scheduling problem is solved by using a Simulated Annealing (SA) and Genetic Algorithm (GA) instead of mathematical programming. These two well-known search algorithms are often used to solve complex combinational optimization problems. In order to compare the performance of the two algorithms, we use solution quality (under the same computational time) and computation efficiency (under the same solution quality) as the measuring criteria. From the example problem, we found that SA is superior to GA in both solution quality and computation efficiency under identical terminating conditions. The performance of SA and GA decreased upon increasing the number of jobs. Our main contributions are to compare SA and GA under limited resources, which would be more consistent with the real world.

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

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

U2 - 10.1142/S0217595906000802

DO - 10.1142/S0217595906000802

M3 - Article

AN - SCOPUS:33645690307

VL - 23

SP - 41

EP - 59

JO - Asia-Pacific Journal of Operational Research

JF - Asia-Pacific Journal of Operational Research

SN - 0217-5959

IS - 1

ER -