A three-agent scheduling problem for minimizing the total tardiness on a single machine

被引：0
|
作者：
Lee, Wen-Chiung [1 ]
Wang, Jen-Ya [2 ]
机构：
[1] Feng Chia Univ, Dept Stat, Taichung, Taiwan
[2] Hungkuang Univ, Dept Comp Sci & Informat Management, Taichung, Taiwan
来源：
PROCEEDINGS 2016 5TH IIAI INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS IIAI-AAI 2016 | 2016年
关键词：
Two-agent scheduling; Due window; Total tardiness; Genetic algorithm; DUE-WINDOW ASSIGNMENT; 2-AGENT ORDER ACCEPTANCE; COMMON FLOW ALLOWANCE; RESOURCE-ALLOCATION; PROCESSING TIMES; ALGORITHMS; MULTIPLE; AGENTS; SUM;
D O I：
10.1109/IIAI-AAI.2016.40
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
Two-agent scheduling problems have been widely studied for many years. However, in the real world, there might be many agents competing for limited resources. This study explores a three-agent scheduling problem. The objective is to minimize the total tardiness of jobs from agent 1 with the restriction that all the jobs from agent 2 must be completed within a common due window, and each job from agent 3 needs to be completed within its individual due window. A simple genetic algorithm is proposed to observe the properties of this problem. Computational results show that the proposed algorithm fits the three-agent scheduling problem well.
引用
收藏
页码：664 / 668
页数：5
相关论文
共 50 条
12345