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 条

[41] Open shop scheduling problem to minimize total weighted completion time [J].

Bai, Danyu ;

Zhang, Zhihai ;

Zhang, Qiang ;

Tang, Mengqian .

ENGINEERING OPTIMIZATION, 2017, 49 (01) :98-112

[42] Online scheduling of a single machine to minimize total weighted completion time [J].

Anderson, EJ ;

Potts, CN .

MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) :686-697

[43] Scheduling a maintenance activity to minimize total weighted completion-time [J].

Mosheiov, Gur ;

Sarig, Assaf .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2009, 57 (04) :619-623

[44] Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times [J].

Leung, Joseph Y. -T. ;

Ng, C. T. ;

Cheng, T. C. Edwin .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) :1090-1099

[45] SIMULTANEOUS RESOURCE SCHEDULING WITH BATCHING TO MINIMIZE WEIGHTED FLOW TIMES [J].

DOBSON, G ;

KHOSLA, I .

IIE TRANSACTIONS, 1995, 27 (05) :587-598

[46] Simultaneous resource scheduling with batching to minimize weighted flow times [J].

Univ of Rochester, Rochester, United States .

IIE Trans, 5 (587-598)

[47] ONLINE SCHEDULING OF TWO UNIFORM MACHINES TO MINIMIZE TOTAL COMPLETION TIMES [J].

Liu, P. ;

Lu, X. .

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2009, 5 (01) :95-102

[48] On-line scheduling of parallel machines to minimize total completion times [J].

Liu, Peihai ;

Lu, Xiwen .

COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) :2647-2652

[49] Concise review of relaxations and approximation algorithms for nonidentical parallel-machine scheduling to minimize total weighted completion times [J].

Li Kai Yang Shanlin School of ManagementHefei Univof TechnologyHefei PRChina .

JournalofSystemsEngineeringandElectronics, 2008, (04) :827-834

[50] Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models [J].

Nhan-Quy Nguyen ;

Yalaoui, Farouk ;

Amodeo, Lionel ;

Chehade, Hicham ;

Toggenburger, Pascal .

Intelligent Information and Database Systems, ACIIDS 2016, Pt II, 2016, 9622 :286-295

← 1 2 3 4 5 →