Two-agent scheduling on a single machine to minimize the total completion time and tardiness
碩士 === 逢甲大學 === 統計與精算所 === 99 === Often a decision maker has to decide the schedule based on multiple criteria. On the other hand, jobs might be from several customers which have their different goals to pursue. In this paper, we consider a single machine two-agent problem where the objective is to...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/66575273597552673039 |