An exact approach to minimizing total weighted tardiness with release dates

被引：31

作者：

Akturk, MS ^{[1
]}

Ozdemir, D ^{[1
]}

机构：

[1] Bilkent Univ, Dept Ind Engn, TR-06533 Ankara, Turkey

来源：

IIE TRANSACTIONS | 2000年 / 32卷 / 11期

关键词：

D O I：

10.1023/A:1013741325877

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound algorithm. The proposed algorithm is tested on a set of randomly generated problems with 10, 15 and 20 jobs. To the best of our knowledge, this is the first exact approach that attempts to solve the 1\r(j)\Sigma w(j)T(j) problem.

引用

页码：1091 / 1101

页数：11

共 23 条

[1] A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM [J].

ABDULRAZAQ, TS ;

POTTS, CN ;

VANWASSENHOVE, LN .

DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) :235-253

[2]

Akturk MS, 1998, COMPUT OPER RES, V25, P265, DOI 10.1016/S0305-0548(97)00073-7

[3]

AKTURK MS, 1998, 9830 BILK U DEP IND

[4] SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].

BELOUADAH, H ;

POSNER, ME ;

POTTS, CN .

DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) :213-231

[5]

Chand S, 1996, NAV RES LOG, V43, P709, DOI 10.1002/(SICI)1520-6750(199608)43:5<709::AID-NAV7>3.0.CO

[6]

2-9

[7] SOME NEW EFFICIENT METHODS TO SOLVE THE N/1/RI/SIGMA-TI SCHEDULING PROBLEM [J].

CHU, C ;

PORTMANN, MC .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 58 (03) :404-413

[8]

CHU CB, 1992, NAV RES LOG, V39, P859, DOI 10.1002/1520-6750(199210)39:6<859::AID-NAV3220390610>3.0.CO

[9]

2-W

[10]

CHU CB, 1992, NAV RES LOG, V39, P265, DOI 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO

← 1 2 3 →