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 …