Heuristics Based on Partial Enumeration for the Unrelated Parallel Processor Scheduling Problem

Author： Mokotoff E.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.117, Iss.1-4, 2002-11, pp. : 133-150

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

Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times

By Rabadi Ghaith   Moraga Reinaldo   Al-Salem Ameer  

Journal of Intelligent Manufacturing, Vol. 17, Iss. 1, 2006-02 ,pp. : 85-97

Springer Publishing Company

Access to resources Recommend Favorite

An analysis of heuristics for the parallel-machine flexible-resource scheduling problem

By Daniels R.L.   Hoopes B.J.   Mazzola J.B.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 439-472

Springer Publishing Company

Access to resources Recommend Favorite

On-line parallel heuristics, processor scheduling and robot searching under the competitive framework

By Lopez-Ortiz A.   Schuierer S.  

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 527-537

Elsevier

Access to resources Recommend Favorite

Scheduling tasks of a parallel program in two-processor systems with use of cellular automata

By Seredynski F.  

Future Generation Computer Systems, Vol. 14, Iss. 5, 1998-12 ,pp. : 351-364

Elsevier

Access to resources Recommend Favorite

Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem

By Zomaya Albert Y.   Patterson Daniel   Olariu Stephan  

Cluster Computing, Vol. 7, Iss. 2, 2004-04 ,pp. : 123-139

Springer Publishing Company

Access to resources Recommend Favorite