Scheduling Equal-Length Jobs with Delivery times on Identical Processors

Author： Vakhania Nodari  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.79, Iss.6, 2002-01, pp. : 715-728

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

Preemptive scheduling of equal-length jobs to maximize weighted throughput

By Baptiste P.   Chrobak M.   Durr C.   Jawor W.   Vakhania N.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 258-264

Elsevier

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

Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs

By Brucker Peter   Kravchenko Svetlana  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 2, 2006-06 ,pp. : 143-165

Springer Publishing Company

Access to resources Recommend Favorite

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

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