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

共 50 条

[31] Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
Oron, Daniel
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (06) : 2071 - 2078
[32] BATCH SCHEDULING TO MINIMIZE TOTAL COMPLETION-TIME
GHOSH, JB
OPERATIONS RESEARCH LETTERS, 1994, 16 (05) : 271 - 275
[33] Scheduling of Software Test to Minimize the Total Completion Time
Chao, Man-Ting
Lin, Bertrand M. T.
MATHEMATICS, 2023, 11 (22)
[34] Scheduling with Rejection to Minimize the Total Weighted Completion Time
Zhang, Shu-Xia
Cao, Zhi-Gang
Zhang, Yu-Zhong
OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 111 - +
[35] A Two-Machine Flowshop Scheduling Problem with a Job Precedence Constraint to Minimize the Total Completion Time
Xu, Jianyou
Lin, Win-Chin
Yin, Yunqiang
Cheng, Yu
Wu, Chin-Chia
JOURNAL OF SCIENTIFIC & INDUSTRIAL RESEARCH, 2017, 76 (12): : 761 - 766
[36] Two-agent single-machine scheduling to minimize resource consumption with a constraint on the makespan
Liu, Peng P
Tian, Xiaoyu
PROCEEDINGS OF 2013 6TH INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING (ICIII 2013) VOL 1, 2013, : 487 - 489
[37] SINGLE-MACHINE SCHEDULING TO MINIMIZE WEIGHTED SUM OF COMPLETION TIMES WITH SECONDARY CRITERION - A BRANCH AND BOUND APPROACH
BANSAL, SP
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (03) : 177 - 181
[38] Two-machine flowshop scheduling problem with bounded processing times to minimize total completion time
Aydilek, Harun
Allahverdi, Ali
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 59 (02) : 684 - 693
[39] Modeling and scheduling open shops with sequence-dependent setup times to minimize total completion time
Naderi, Bahman
Ghomi, S. M. T. Fatemi
Aminnayeri, M.
Zandieh, M.
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 53 (5-8): : 751 - 760
[40] Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
Chen, Rubing
Yuan, Jinjiang
DISCRETE APPLIED MATHEMATICS, 2021, 304 (304) : 45 - 54

← 1 2 3 4 5 →