ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS

被引：220

作者：

EMMONS, H

机构：

来源：

OPERATIONS RESEARCH | 1969年 / 17卷 / 04期

关键词：

D O I：

10.1287/opre.17.4.701

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Problems of sequencing n jobs on one machine to minimize total tardiness are discussed; theorems that establish relative order in which pairs of jobs are processed in optimal schedule are proved; results are partly extended to more general criterion of minimizing sum of identical, convex, nondecreasing functions of job tardiness and efficient algorithm is proposed.

引用

页码：701 / &

共 7 条

[1]

Conway R. W., 1967, THEORY SCHEDULING

[2]

ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105

[3]

HELD M, 1962, SIAM J, V10, P196

[4] ON SCHEDULING PROBLEMS WITH DEFERRAL COSTS [J].