Two-agent scheduling to minimize total completion time on two-machine flowshop with learning effects
碩士 === 逢甲大學 === 統計與精算所 === 100 === Scheduling with learning effects has drawn the attention of many researchers in the past decade. However, jobs might come from different customers who have different goals to pursue. In this paper, we studied a two-agent problem on two-machine permutation flowshop...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85938411184394320457 |