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: | Lawson Ding, 丁浩 |
---|---|
Other Authors: | W.C. Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/66575273597552673039 |
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) -
A single machine scheduling to minimize the total completion time and maximum tardiness with two agents
by: Zong-Ren Huang, et al.
Published: (2011) -
Single-machine two-agent scheduling to minimize the total tardiness with release time
by: Mei-Chia Hu, et al.
Published: (2012) -
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)