Single-machine scheduling to minimize the total completion time and tardiness with two competing agents
碩士 === 逢甲大學 === 統計與精算所 === 100 === Scheduling with two competing agents has become a popular research topic in recent years. Most of the research focuses on the objective functions with constraint forms, that is, to minimize the objective function of jobs from one agent given that the objective func...
Main Authors: | Chih-Yu Liu, 劉芷羽 |
---|---|
Other Authors: | Wen-Chiung Lee |
Format: | Others |
Language: | zh-TW |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/20920977425406159548 |
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) -
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) -
Single-machine two-agent scheduling to minimize the total tardiness with release time
by: Mei-Chia Hu, et al.
Published: (2012) -
An advanced genetic algorithm for single-machine scheduling to minimize the total tardiness with learning effects and two competing agents
by: Hsin-wei Su, et al.
Published: (2012)