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 and Hern-Jiang Lin
Additional contact information
Tai-Yue Wang: Department of Industrial and Information Management, National Cheng Kung University, Tainan, Taiwan, ROC
Yih-Hwang Yang: Department of Industrial and Information Management, National Cheng Kung University, Tainan, Taiwan, ROC
Hern-Jiang Lin: Department of Industrial and Information Management, National Cheng Kung University, Tainan, Taiwan, ROC

Asia-Pacific Journal of Operational Research (APJOR), 2006, vol. 23, issue 01, 41-59

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.

Keywords: No-wait flow shop; simulated annealing; genetic algorithm; cyclic scheduling problem (search for similar items in EconPapers)
Date: 2006
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595906000802
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:23:y:2006:i:01:n:s0217595906000802

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595906000802

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().