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

Author： Li Rongheng   Cheng Xiayan   Zhou Yunxia  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

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

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

Related content

Semi-online scheduling for jobs with release times

By Li Rongheng   Yang Liying   He Xiaoqiong   Chen Qiang   Cheng Xiayan  

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 448-464

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling uniform machines on-line requires nondecreasing speed ratios

By Vestjens A.P.A.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 225-234

Elsevier

Access to resources Recommend Favorite

Online LPT algorithms for parallel machines scheduling with a single server

By Su Chunjie  

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 480-488

Springer Publishing Company

Access to resources Recommend Favorite

Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan

By Li Shisheng   Yuan Jinjiang  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 84-93

Springer Publishing Company

Access to resources Recommend Favorite

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

By Du Dong-lei  

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 485-488

Springer Publishing Company

Access to resources Recommend Favorite