An Openshop Two Machine Problem with Blocking─A Comparison of Random Search Algorithm and Genetic Algorithm
碩士 === 東海大學 === 工業工程學系 === 89 === In this paper, considering a two-machine scheduling problem in an openshop with blocking jobs. We are given the processing times of n blocking jobs on both machines, and the objective is to minimize the makespan. Symbolically, we are dealing with the problem O2|Bloc...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/06392987608774576830 |