Parallel Servers Scheduling with Dynamic Sequence-Dependent Setup Time

被引：0
|
作者：
Thanh-Cong Dinh [1 ]
Bae, Hyerim [1 ]
机构：
[1] Pusan Natl Univ, Business & Serv Comp Lab, Pusan 609735, South Korea
来源：
INTELLIGENT DECISION TECHNOLOGIES (IDT'2012), VOL 2 | 2012年 / 16卷
关键词：
Dynamic sequence-dependent setup time; task scheduling; parallel servers; multiple servers; mixed integer programming; multi-depot multiple asymmetric traveling salesmen (MmATSP);
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper deals with task scheduling problem in industrial consulting companies with dynamic sequence-dependent setup time by considering parallel servers (or multiple servers). The problem is transformed to multi-depot multiple asymmetric traveling salesman problem (MmATSP). A mixed integer programming model is formulated to minimize sum of tardiness time and sum of setup time.
引用
收藏
页码：79 / 87
页数：9
相关论文
共 50 条
12345