An application of multiprocessor scheduling methods in the production of digital holographic images

This paper addresses the scheduling policy being developed for a manufacturer/producer of digital holographic images. Due to the nature of the equipment set used by this manufacturer, the machines are essentially identical - this is usually an unrealistic assumption in most shop floors. Consequently, the production schedule to be generated herein is therefore a candidate for direct application of well-known (identical) multiprocessor scheduling techniques. The scheduling policy discussed is addressed in two-phases. The first phase consists of equally distributing (assigning) the images (jobs) to be processed among the different machines - this is, of course, the minimum makespan problem. The second phase consists of developing the sequence for each job set assigned to the different machines. This second (sequencing) phase is subject to a special constraint on the production time schedule related to the availability of the operator.