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

ISSN： 1382-6905

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

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 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

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

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

By Liu Ming Chu Chengbin Xu Yinfeng Zheng Feifeng

Journal of Combinatorial Optimization, Vol. 21, Iss. 1, 2011-01 ,pp. : 138-149

Springer Publishing Company

Access to resources Recommend Favorite

Semi-online scheduling with “end of sequence” information

By Epstein Leah Ye Deshi

Journal of Combinatorial Optimization, Vol. 14, Iss. 1, 2007-07 ,pp. : 45-61

Springer Publishing Company

Access to resources Recommend Favorite