A robust genetic algorithm to solve the open shop problem with minimizing weighted total completion time
碩士 === 正修科技大學 === 工業工程與管理研究所 === 95 === The scheduling concept and skills are implemented in our dally life such as the people waiting for services, and the timetable of train. However, in some reality scheduling cases are analogized to the open shop problem. For example a maintenance processes of a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/14802631052407964491 |