HEURISTIC PROCEDURES FOR MINIMIZING MAKESPAN AND THE NUMBER OF REQUIRED PALLETS

Authors
CHU CB PROTH JM SETHI S
Citation
Cb. Chu et al., HEURISTIC PROCEDURES FOR MINIMIZING MAKESPAN AND THE NUMBER OF REQUIRED PALLETS, European journal of operational research, 86(3), 1995, pp. 491-502
Citations number
18
Categorie Soggetti
Management,"Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
86
Issue
3
Year of publication
1995
Pages
491 - 502
Database
ISI
SICI code
0377-2217(1995)86:3<491:HPFMMA>2.0.ZU;2-1
Abstract
A heuristic procedure is developed for minimizing makespan in flow-sho p scheduling problems. In comparison with current algorithms, our algo rithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the r equired number of pallets for a given makespan.