Heuristic procedures for minimizing makespan and the number of required pallets

Heuristic procedures for minimizing makespan and the number of required pallets

0.00 Avg rating0 Votes
Article ID: iaor19981668
Country: Netherlands
Volume: 86
Issue: 3
Start Page Number: 491
End Page Number: 502
Publication Date: Nov 1995
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.