Scheduling to minimize the weighted sum of completion times

被引：0
作者：
Zhao, Chuan-Li [1 ]
Zhang, Qing-Ling [1 ]
Tang, Heng-Yong [2 ]
机构：
[1] Sch. of Sci., Northeastern Univ., Shenyang 110004, China
[2] Dept. of Math., Shenyang Normal Univ., Shenyang 110034, China
来源：
Dongbei Daxue Xuebao/Journal of Northeastern University | 2003年 / 24卷 / 06期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Scheduling
引用
收藏
页码：515 / 518
相关论文
共 50 条
[31]   Multi-agent Scheduling to Minimize Total Completion Times [J].
Chen, Ru-Bing ;
Gao, Yuan ;
Yuan, Jin-Jiang ;
Zhao, Qiu-Lan .
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2025,
[32]   Two-agent singe-machine scheduling with release times to minimize the total weighted completion time [J].
Cheng, T. C. E. ;
Chung, Yu-Hsiang ;
Liao, Shan-Ci ;
Lee, Wen-Chiung .
COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) :353-361
[33]   Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks [J].
Dinitz, Michael ;
Moseley, Benjamin .
IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, :1043-1052
[34]   Two-Agent Supply Chain Scheduling Problem to Minimize the Sum of the Total Weighted Completion Time and Batch Cost [J].
Yang L.-Y. ;
Lu X.-W. .
Journal of the Operations Research Society of China, 2017, 5 (02) :257-269
[35]   The constrained minimum weighted sum of job completion times problem [J].
Levin, Asaf ;
Woeginger, Gerhard J. .
MATHEMATICAL PROGRAMMING, 2006, 108 (01) :115-126
[36]   Minimizing the sum of weighted completion times in a concurrent open shop [J].
Mastrolilli, Monaldo ;
Queyranne, Maurice ;
Schulz, Andreas S. ;
Svensson, Ola ;
Uhan, Nelson A. .
OPERATIONS RESEARCH LETTERS, 2010, 38 (05) :390-395
[37]   The constrained minimum weighted sum of job completion times problem [J].
Levin, A ;
Woeginger, GJ .
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2004, 3064 :298-307
[38]   The constrained minimum weighted sum of job completion times problem [J].
Asaf Levin ;
Gerhard J. Woeginger .
Mathematical Programming, 2006, 108 :115-126
[39]   A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs [J].
Rajendran, C ;
Ziegler, H .
COMPUTERS & INDUSTRIAL ENGINEERING, 1997, 33 (1-2) :281-284
[40]   Single machine lot scheduling to minimize maximum weighted completion time [J].
Zheng, Feifeng ;
Li, Na ;
Liu, Ming ;
Xu, Yinfeng .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 50 (01)
12345