A Solution of Production Scheduling Problem Adapting Fast Model of Parallel Heuristics


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 4, pp. 959-967, Apr. 1999
10.3745/KIPSTE.1999.6.4.959,   PDF Download:

Abstract

Several papers have reported that parallel heuristics or hybrid approaches combining several heuristics can get better results. However, the parallelization and hybridization of any search methods on the single CPU type computer need enormous computation time. That case, we need more elegant combination method. For this purpose, we purpose Fast Model of Parallel Heuristics(FMPH). FMPH is based on the island model of parallel genetic algorithms and takes local search to the elite solution obtained from each island(sub group). In this paper we introduce how can we adapt FMPH to the job-shop scheduling problem notorious as the most difficult NP-hard problem and report the excellent results of several famous benchmark problems.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. S. Chan and C. B. Jun, "A Solution of Production Scheduling Problem Adapting Fast Model of Parallel Heuristics," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 4, pp. 959-967, 1999. DOI: 10.3745/KIPSTE.1999.6.4.959.

[ACM Style]
Hong Sung Chan and Cho Byung Jun. 1999. A Solution of Production Scheduling Problem Adapting Fast Model of Parallel Heuristics. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 4, (1999), 959-967. DOI: 10.3745/KIPSTE.1999.6.4.959.