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: | Mei-Chia Hu, 胡美佳 |
---|---|
Other Authors: | Wen-Chiung Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/55551843833370687059 |
Similar Items
-
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
by: Wen-Chiung Lee, et al.
Published: (2014-01-01) -
Single-machine scheduling to minimize the total completion time and tardiness with two competing agents
by: Chih-Yu Liu, et al.
Published: (2012) -
Two-agent scheduling on a single machine to minimize the total completion time and tardiness
by: Lawson Ding, et al.
Published: (2011) -
A single machine scheduling to minimize the total completion time and maximum tardiness with two agents
by: Zong-Ren Huang, et al.
Published: (2011) -
Genetic algorithm for single-machine scheduling to minimize total tardiness with the minimize total tardiness with the minmize number of tardy jobs
by: Lai Yu-Ling, et al.
Published: (2005)