Printing Scheduling Using Peter Rof-Hamm Algorithm

Abstract

The minimum whole production time is a very effective tool to improve production efficiency in the printing company. Printing scheduling is a key to achieve this goal. In this paper, we use Peter Rof-Hamm algorithm to determine better printing scheduling quickly with the minimum whole production time. Performance of the proposed method is compared with rule-based heuristic algorithm. This proposed algorithm is very simple, and it can get near-optimum printing scheduling quickly, which makes it more useful in the printing scheduling.