Characterization of the iterative application of makespan heuristics on non-makespan machines in a heterogeneous parallel and distributed environment

Author： Briceño Luis

Publisher： Springer Publishing Company

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.62, Iss.1, 2012-10, pp. : 461-485

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

A LISTFIT heuristic for minimizing makespan on identical parallel machines

By Gupta J. N. D. Ruiz-Torres A. J.

Production Planning and Control, Vol. 12, Iss. 1, 2001-01 ,pp. : 28-36

Taylor & Francis Ltd

Access to resources Recommend Favorite

A LISFIT heuristic for minimizing makespan on identical parallel machines

By Gupta J. N. D. Ruiz-Torres A. J.

Production Planning and Control, Vol. 12, Iss. 3, 2001-04 ,pp. : 309-309

Taylor & Francis Ltd

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

A GRASP approach for makespan minimization on parallel batch processing machines

By Damodaran Purushothaman

Journal of Intelligent Manufacturing, Vol. 22, Iss. 5, 2011-10 ,pp. : 767-777

Springer Publishing Company

Access to resources Recommend Favorite

Scheduling parallel jobs to minimize the makespan

By Johannes Berit

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 433-452

Springer Publishing Company

Access to resources Recommend Favorite