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

Author： Brucker Peter   Kravchenko Svetlana  

Publisher： Springer Publishing Company

ISSN： 1570-1166

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

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

Scheduling Equal-Length Jobs with Delivery times on Identical Processors

By Vakhania Nodari  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time

By Chen Bo   Deng Xiaotie   Zang Wenan  

Journal of Combinatorial Optimization, Vol. 8, Iss. 1, 2004-03 ,pp. : 85-95

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