Single-machine two-agent scheduling to minimize the total tardiness with release time
碩士 === 逢甲大學 === 統計與精算所 === 100 === The needs of customers are different under limited labor power, resourses and cost control. It will be more effective if we plan ahead. In recent years, the scheduling problems with two competing agents have become more popular. In this paper, we studied a single-m...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/55551843833370687059 |