SCHEDULING TO MINIMIZE THE TOTAL RESOURCE CONSUMPTION WITH A CONSTRAINT ON THE SUM OF COMPLETION TIMES

被引：19

作者：

LI, CL

机构：

[1] John M. Olin School of Business, Washington University, St. Louis

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1995年 / 80卷 / 02期

关键词：

SCHEDULING; SEQUENCING; RELEASE DATES; RESOURCE ALLOCATION;

D O I：

10.1016/0377-2217(93)E0255-V

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider the problem of scheduling a set of jobs on a single machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total amount of resource consumed subject to a constraint on the sum of completion times of the jobs. We show that the problem is NP-hard in general and can be solved efficiently when the resource consumption function is linear. The parallel machine case is also discussed.

引用

页码：381 / 388

页数：8

共 8 条

[1]

CHENT TCE, 1994, IN PRESS IEEE T AUTO

[2]

Conway R, 1967, THEORY SCHEDULING

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