A GRASP approach for makespan minimization on parallel batch processing machines

ISSN： 0956-5515

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

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

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

Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivals

By Li XiaoLin Chen HuaPing Du Bing Tan Qi

International Journal of Computer Integrated Manufacturing, Vol. 26, Iss. 5, 2013-05 ,pp. : 474-486

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

By Yuan Jinjiang

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 361-369

Springer Publishing Company

Access to resources Recommend Favorite