A cutting plane algorithm for solving single machine scheduling problems with uncertain sequence-dependent setup times

被引:0
|
作者
Zegordi, S. H. [1 ]
Nikbakhsh, E. [1 ]
Modarres, M. [2 ]
机构
[1] Tarbiat Modares Univ, Fac Engn, Dept Ind Engn, Tehran, Iran
[2] Sharif Univ Technol, Dept Ind Engn, Tehran, Iran
来源
PROCEEDINGS OF THE 36TH INTERNATIONAL MATADOR CONFERENCE | 2010年
关键词
Scheduling; Single Machine; Sequence-Dependent Setup Times; Traveling Salesman Problem; Interval Uncertainty; TRAVELING SALESMAN PROBLEMS; TARDINESS;
D O I
10.1007/978-1-84996-432-6_27
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a variant of the single machine scheduling problem is considered in which the sequence-dependent setup times are assumed to be uncertain and they can take any real value from a closed interval. For tackling the problem, a mathematical model based on the robust traveling salesman problem is proposed for minimizing the makespan. Then, the proposed model is solved via a cutting plane algorithm. Finally, the computational experiments show the effectiveness of the proposed algorithm in comparison with a commercial optimization software generic branch & bound.
引用
收藏
页码:119 / 122
页数:4
相关论文
共 50 条