An exact approach to minimizing total weighted tardiness with release dates

被引：32

作者：

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 条

[11]

2-L

[12] ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].

EMMONS, H .

OPERATIONS RESEARCH, 1969, 17 (04) :701-&

[13] AN ALGORITHM FOR SINGLE-MACHINE SEQUENCING WITH RELEASE DATES TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].

HARIRI, AMA ;

POTTS, CN .

DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :99-109

[14]

KAN AHG, 1975, OPER RES, V23, P908

[15]

Lawler E. L., 1977, ANN DISCRETE MATH, V1, P331, DOI [DOI 10.1016/S0167-5060(08)70742-8, 10.1016/S0167-5060(08)70742-8]

[16] A BRANCH AND BOUND ALGORITHM FOR THE TOTAL WEIGHTED TARDINESS PROBLEM [J].

POTTS, CN ;

VANWASSENHOVE, LN .

OPERATIONS RESEARCH, 1985, 33 (02) :363-377

[17] ALGORITHMS FOR SCHEDULING A SINGLE-MACHINE TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS [J].

POTTS, CN ;

VANWASSENHOVE, LN .

MANAGEMENT SCIENCE, 1988, 34 (07) :843-858

[18] A NOTE ON THE WEIGHTED TARDINESS PROBLEM [J].

RACHAMADUGU, RMV .

OPERATIONS RESEARCH, 1987, 35 (03) :450-452

[19]

Rinnooy Kan AHG, 1976, Machine scheduling problems: classification, complexity and computations

[20]

Smith W., 1956, Naval Res. Logistics Q., V3, P59, DOI [DOI 10.1002/NAV.3800030106, 10.1002/nav.3800030106]

← 1 2 3 →