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

Author： Rajendran C.

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

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

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

Scheduling parallel machines to minimize weighted flowtime with family set-up times

By Azizoglu M.

International Journal of Production Research, Vol. 41, Iss. 6, 2003-01 ,pp. : 1199-1215

Taylor & Francis Ltd

Access to resources Recommend Favorite

Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness

By Nishi Tatsushi Hiranaka Yuichiro

International Journal of Production Research, Vol. 51, Iss. 16, 2013-08 ,pp. : 4778-4796

Taylor & Francis Ltd

Access to resources Recommend Favorite

Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness

By Hari Balasubramanian

International Journal of Production Research, Vol. 42, Iss. 8, 2004-04 ,pp. : 1621-1638

Taylor & Francis Ltd

Access to resources Recommend Favorite

An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

By Kutanoglu E. Sabuncuoglu I.

International Journal of Production Research, Vol. 37, Iss. 1, 1999-01 ,pp. : 165-187

Taylor & Francis Ltd

Access to resources Recommend Favorite

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