Complexity of scheduling problems with multi-purpose machines

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.70, Iss.1, 1997-01, pp. : 57-73

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

Multi-purpose biometric performance grading scheme

By Lazarick Richard T.

International Journal of Biometrics, Vol. 5, Iss. 1, 2013-12 ,pp. : 99-111

Inderscience Publishers

Access to resources Recommend Favorite

Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines

By He Yong Jiang Yiwei

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 367-383

Springer Publishing Company

Access to resources Recommend Favorite

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

By Dereniowski Dariusz Kubiak Wiesław

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 479-492

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of mean flow time scheduling problems with release times

By Baptiste Philippe Brucker Peter Chrobak Marek Dürr Christoph Kravchenko Svetlana Sourd Francis

Journal of Scheduling, Vol. 10, Iss. 2, 2007-04 ,pp. : 139-146

Springer Publishing Company

Access to resources Recommend Favorite

Engineering a multi-purpose test collection for Web retrieval experiments

By Bailey P. Craswell N. Hawking D.

Information Processing and Management, Vol. 39, Iss. 6, 2003-11 ,pp. : 853-871

Elsevier

Access to resources Recommend Favorite