Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs

E-ISSN： 1029-0265|92|5|873-881

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.92, Iss.5, 2015-05, pp. : 873-881

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Semi-online scheduling with known maximum job size on two uniform machines

By Cao Qian Liu Zhaohui

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 369-384

Springer Publishing Company

Access to resources Recommend Favorite

A note on hierarchical scheduling on two uniform machines

By Tan Zhiyi Zhang An

Journal of Combinatorial Optimization, Vol. 20, Iss. 1, 2010-07 ,pp. : 85-95

Springer Publishing Company

Access to resources Recommend Favorite

Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines

By Li Rongheng Cheng Xiayan Zhou Yunxia

Optimization, Vol. 63, Iss. 6, 2014-06 ,pp. : 867-882

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semi-online scheduling on two identical machines with rejection

By Min Xiao Wang Yuqing Liu Jing Jiang Min

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 472-479

Springer Publishing Company

Access to resources Recommend Favorite

On-line and semi-online scheduling for flow shop problems on two machines

By Yang Ming Lu Xiwen

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 499-507

Taylor & Francis Ltd

Access to resources Recommend Favorite