Two-machine flow shop total tardiness scheduling problem with deteriorating jobs

被引：14
|
作者：
Bank, M. [1 ]
Ghomi, S. M. T. Fatemi [1 ]
Jolai, F. [2 ]
Behnamian, J. [1 ]
机构：
[1] Amirkabir Univ Technol, Dept Ind Engn, Tehran 1591634311, Iran
[2] Univ Tehran, Coll Engn, Dept Ind Engn, Tehran, Iran
来源：
APPLIED MATHEMATICAL MODELLING | 2012年 / 36卷 / 11期
关键词：
Flow shop; Scheduling; Deteriorating job; Branch and bound algorithm; Heuristic algorithm; SIMPLE LINEAR DETERIORATION; DEPENDENT PROCESSING TIMES; IDLE DOMINANT MACHINES; COMPLETION-TIME;
D O I：
10.1016/j.apm.2011.12.010
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper studies a two-machine scheduling problem with deteriorating jobs which their processing times depend on their waiting time. We develop a branch and bound algorithm to minimize the total tardiness criteria. A lower bound, several dominance properties and an initial upper bound derived from a heuristic algorithm are used to increase the speed of branch and bound algorithm and decrease its required memory space. Computational results are presented to evaluate effectiveness and efficiency of the algorithms. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码：5418 / 5426
页数：9
相关论文
共 50 条
12345