HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074745
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:13:12 PM
Last modification on : Friday, February 4, 2022 - 3:22:02 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 6:53:33 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

227

Files downloads

110