An MPI Branch-and-Bound Skeleton for a Production Scheduling Problem
碩士 === 國立暨南國際大學 === 資訊管理學系 === 93 === In this thesis, we propose an efficient and easy-to-implement parallel branch-and-bound algorithm using a message-passing model. To study the efficiency of the proposed model, we apply it to a two-machine flowshop scheduling problem of minimizing total completio...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57800299018410476642 |