Issue 3/2017
Content (19 Articles)
A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable
Miao Zhang, Min Chen, Yiqiao Wang
Total completion time minimization in online hierarchical scheduling of unit-size jobs
Jueliang Hu, Yiwei Jiang, Ping Zhou, An Zhang, Qinghui Zhang
On the odd girth and the circular chromatic number of generalized Petersen graphs
Amir Daneshgar, Meysam Madani
Scheduling with release times and rejection on two parallel machines
Xueling Zhong, Zhangming Pan, Dakui Jiang
Two-agent scheduling problems on a single-machine to minimize the total weighted late work
Zhang Xingong, Wang Yong
Construction independent spanning trees on locally twisted cubes in parallel
Yu-Huei Chang, Jinn-Shyong Yang, Sun-Yuan Hsieh, Jou-Ming Chang, Yue-Li Wang
The no-wait job shop with regular objective: a method based on optimal job insertion
Reinhard Bürgy, Heinz Gröflin
A new sufficient condition for a tree T to have the (2, 1)-total number
Qiaojun Shu, Weifan Wang, Yiqiao Wang
Augmenting weighted graphs to establish directed point-to-point connectivity
Mehdy Roayaei, Mohammadreza Razzazi
Power load forecasting by wavelet least squares support vector machine with improved fruit fly optimization algorithm
Niu Dongxiao, Ma Tiannan, Liu Bingyi