论文信息 - On scheduling with non-increasing time slot cost to minimize total weighted completion time - 字舞流文

On scheduling with non-increasing time slot cost to minimize total weighted completion time

Minming Li | X. Qi | Yingchao Zhao

[1] Lin Chen,et al. Optimal Algorithms and a PTAS for Cost-Aware Scheduling , 2015, MFCS.

[2] Kamesh Munagala,et al. Algorithms for Cost-Aware Scheduling , 2012, WAOA.

[3] Xiangtong Qi,et al. Scheduling with variable time slot costs , 2010 .

[4] George L. Vairaktarakis,et al. Coordination of Outsourced Operations to Minimize Weighted Flow Time and Capacity Booking Costs , 2009, Manuf. Serv. Oper. Manag..

[5] Michael Pinedo. Scheduling: Theory, Algorithms, and Systems , 1994 .

[6] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

[7] Qing Hua Qin,et al. Recent Advances in Computer Science and Information Engineering , 2012, CSIE 2012.

[8] Weiya Zhong,et al. A Single Machine Scheduling Problem with Time Slot Costs , 2012 .