Heuristic procedures for minimizing makespan and the number of required pallets

Abstract : A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number of pallets for a given makespan.
Type de document :
Rapport
[Research Report] RR-1929, INRIA. 1993, pp.17
Liste complète des métadonnées

https://hal.inria.fr/inria-00074745
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:13:12
Dernière modification le : samedi 17 septembre 2016 - 01:06:52
Document(s) archivé(s) le : mardi 12 avril 2011 - 18:53:33

Fichiers

Identifiants

  • HAL Id : inria-00074745, version 1

Collections

Citation

Chengbin Chu, Jean-Marie Proth, Suresh Sethi. Heuristic procedures for minimizing makespan and the number of required pallets. [Research Report] RR-1929, INRIA. 1993, pp.17. 〈inria-00074745〉

Partager

Métriques

Consultations de la notice

332

Téléchargements de fichiers

90