MINIMIZING THE WEIGHTED SUM OF LATE AND EARLY COMPLETION PENALTIES IN A SINGLE-MACHINE

被引：21

作者：

AHMED, MU

SUNDARARAGHAVAN, PS

机构：

[1] Information Systems and Operations Management Department, The University of Toledo, Toledo, OH

来源：

IIE TRANSACTIONS | 1990年 / 22卷 / 03期

关键词：

D O I：

10.1080/07408179008964183

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

We consider the problem of scheduling n jobs on a single machine so as to minimize weighted absolute deviation of completion times from their due dates. The general problem is NP-complete, but we show how to solve a special case. © 1990 Taylor & Francis Group, LLC.

引用

收藏

页码：288 / 290

页数：3

相关论文

共 14 条

[1] 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

[2]

Baker K., 1974, INTRO SEQUENCING SCH

[3]

Conway R, 1967, THEORY SCHEDULING

[4] MINIMIZING WAITING TIME VARIANCE IN SINGLE MACHINE PROBLEM [J].

EILON, S ;

CHOWDHURY, IG .

MANAGEMENT SCIENCE, 1977, 23 (06) :567-575

[5] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].

FISHER, ML .

MANAGEMENT SCIENCE, 1981, 27 (01) :1-18

[6] ONE-PROCESSOR SCHEDULING WITH SYMMETRIC EARLINESS AND TARDINESS PENALTIES [J].

GAREY, MR ;

TARJAN, RE ;

WILFONG, GT .

MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :330-348

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

KANET, JJ .

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

[8] VARIANCE MINIMIZATION IN SINGLE MACHINE SEQUENCING PROBLEMS [J].

MERTEN, AG ;

MULLER, ME .

MANAGEMENT SCIENCE SERIES A-THEORY, 1972, 18 (09) :518-528

[9] 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

[10]

Rinnooy Kan AHG, 1976, MACHINE SCHEDULING P