Preemptive scheduling of equal-length jobs to maximize weighted throughput

Author： Baptiste P. Chrobak M. Durr C. Jawor W. Vakhania N.

Publisher： Elsevier

ISSN： 0167-6377

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

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

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

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

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

By Batsyn Mikhail Goldengorin Boris Pardalos Panos M. Sukhov Pavel

Optimization Methods and Software, Vol. 29, Iss. 5, 2014-09 ,pp. : 955-963

Taylor & Francis Ltd

Access to resources Recommend Favorite

Scheduling Jobs Using Common Resources

By Bar-Ilan J. Peleg D.

Information and Computation, Vol. 125, Iss. 1, 1996-02 ,pp. : 52-61

Academic Press

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