Heuristic procedures for minimizing makespan and the number of required pallets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1929.pdf (692.7 Ko) Télécharger le fichier

Dates and versions

inria-00074745 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074745 , version 1

Cite

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⟩
234 View
125 Download

Share

Gmail Facebook Twitter LinkedIn More