COMMON DUE DATE SCHEDULING PROBLEM WITH SEPARATE EARLINESS AND TARDINESS PENALTIES

被引：15

作者：

DILEEPAN, P

机构：

[1] Department of Management, The University of Tennessee at Chattanooga, Chattanooga, TN 37403

来源：

COMPUTERS & OPERATIONS RESEARCH | 1993年 / 20卷 / 02期

关键词：

D O I：

10.1016/0305-0548(93)90073-R

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper considers the problem of finding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solution. An almost optimal heuristic is also presented.

引用

页码：179 / 184

页数：6

共 11 条

[1]

BAGCHI U, 1987, NAV RES LOG, V34, P739, DOI 10.1002/1520-6750(198710)34:5<739::AID-NAV3220340513>3.0.CO

[2]

2-3

[3] MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

BAGCHI, U ;

SULLIVAN, RS ;

CHANG, YL .

NAVAL RESEARCH LOGISTICS, 1986, 33 (02) :227-240

[4] MINIMIZING MEAN SQUARED DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

BAGCHI, U ;

SULLIVAN, RS ;

CHANG, YL .

MANAGEMENT SCIENCE, 1987, 33 (07) :894-906

[5] SURVEY OF SCHEDULING RESEARCH INVOLVING DUE DATE DETERMINATION DECISIONS [J].

CHENG, TCE ;

GUPTA, MC .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 38 (02) :156-166

[6] A NOTE ON A PARTIAL SEARCH ALGORITHM FOR THE SINGLE-MACHINE OPTIMAL COMMON DUE-DATE ASSIGNMENT AND SEQUENCING PROBLEM [J].

CHENG, TCE .

COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) :321-324

[7] SCHEDULING PROBLEMS WITH GENERALIZED DUE DATES [J].

HALL, NG .

IIE TRANSACTIONS, 1986, 18 (02) :220-222

[8] EARLINESS-TARDINESS SCHEDULING PROBLEMS .1. WEIGHTED DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

HALL, NG ;

POSNER, ME .

OPERATIONS RESEARCH, 1991, 39 (05) :836-846

[9] MINIMIZING THE AVERAGE DEVIATION OF JOB COMPLETION TIMES ABOUT A COMMON DUE DATE [J].

KANET, JJ .

NAVAL RESEARCH LOGISTICS, 1981, 28 (04) :643-651

[10] COMMON DUE DATE ASSIGNMENT TO MINIMIZE TOTAL PENALTY FOR THE ONE MACHINE SCHEDULING PROBLEM [J].

PANWALKAR, SS ;

SMITH, ML ;

SEIDMANN, A .

OPERATIONS RESEARCH, 1982, 30 (02) :391-399

← 1 2 →