Resumen

SCHUURMAN, J.  y  VAN VUUREN, J.H.. Scheduling sequence-dependent colour printing jobs. S. Afr. J. Ind. Eng. [online]. 2016, vol.27, n.2, pp.43-59. ISSN 2224-7890.  http://dx.doi.org/10.7166/27-2-1119.

A scheduling problem in the colour printing industry is considered in this paper. The problem is to find an optimal assignment of print jobs to each of a set of colour printers, as well as an optimal processing sequence for the set of jobs assigned to each printer. The objective is to minimise the makespan of the schedule to achieve a suitable balance between the workloads of the printers and the efficiencies of the job sequences assigned to the printers. A novel aspect of the problem is the way in which the printer set-up times associated with the jobs are job sequence-dependent - it is possible to exploit commonalities between the colours required for successive jobs on each machine. We solve this problem approximately by using a simple heuristic and three well-known metaheuristics. Besides colour printing, the scheduling problem considered here admits many other applications. Some of these alternative applications are also briefly described.

        · resumen en Africano     · texto en Inglés     · Inglés ( pdf )