Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem

Author： Framinan J.M.

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.41, Iss.1, 2003-01, pp. : 121-148

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 new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness

By Braglia Marcello

International Journal of Production Research, Vol. 47, Iss. 1, 2009-01 ,pp. : 273-288

Taylor & Francis Ltd

Access to resources Recommend Favorite

Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers

By Rajendran C.

International Journal of Production Research, Vol. 37, Iss. 5, 1999-03 ,pp. : 1137-1158

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem

By Gao Jian Chen Rong Deng Wu

International Journal of Production Research, Vol. 51, Iss. 3, 2013-02 ,pp. : 641-651

Taylor & Francis Ltd

Access to resources Recommend Favorite

A meta-heuristic approach for solving the no-wait flow-shop problem

By Samarghandi Hamed ElMekkawy Tarek Y.

International Journal of Production Research, Vol. 50, Iss. 24, 2012-12 ,pp. : 7313-7326

Taylor & Francis Ltd

Access to resources Recommend Favorite

Flow shop-sequencing problem with synchronous transfers and makespan minimization

By Soylu B. Kirca Ö. Azizoğlu M.

International Journal of Production Research, Vol. 45, Iss. 15, 2007-08 ,pp. : 3311-3331

Taylor & Francis Ltd

Access to resources Recommend Favorite