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

被引：15

作者：

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

共 29 条

[1]

Alidaee B, 1999, J OPER RES SOC, V50, P711, DOI 10.2307/3010325

[2] Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications [J].

Allahverdi, A ;

Al-Anzi, FS .

COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (08) :971-994

[3] Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines [J].

Cheng, MingBao ;

Sun, ShiJie ;

He, LongMin .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (01) :115-124

[4] A concise survey of scheduling with time-dependent processing times [J].

Cheng, TCE ;

Ding, Q ;

Lin, BMT .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) :1-13

[5]

Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117

[6] SINGLE FACILITY SCHEDULING WITH NONLINEAR PROCESSING TIMES [J].

GUPTA, JND ;

GUPTA, SK .

COMPUTERS & INDUSTRIAL ENGINEERING, 1988, 14 (04) :387-393

[7] Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties [J].

Huang, Xue ;

Wang, Ming-Zheng .

APPLIED MATHEMATICAL MODELLING, 2011, 35 (03) :1349-1353

[8] A NEW BRANCH AND BOUND ALGORITHM FOR MINIMIZING MEAN TARDINESS IN 2-MACHINE FLOWSHOPS [J].

KIM, YD .

COMPUTERS & OPERATIONS RESEARCH, 1993, 20 (04) :391-401

[9] NP-hard cases in scheduling deteriorating jobs on dedicated machines [J].

Kononov, A ;

Gawiejnowicz, S .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (06) :708-717

[10] A two-machine flowshop makespan scheduling problem with deteriorating jobs [J].

Lee, Wen-Chiung ;

Wu, Chin-Chia ;

Wen, Chien-Chih ;

Chung, Yu-Hsiang .

COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 54 (04) :737-749

← 1 2 3 →