ITEM VIEW

Scheduling sequence-dependent colour printing jobs

dc.contributor.authorSchuurman, J.en_ZA
dc.contributor.authorVan Vuuren, J. H.en_ZA
dc.date.accessioned2017-10-31T13:53:55Z
dc.date.available2017-10-31T13:53:55Z
dc.date.issued2016
dc.identifier.citationSchuurman, J. & Van Vuuren, J. H. 2016. Scheduling sequence-dependent colour printing jobs. South African Journal of Industrial Engineering, 27(2):43-59, doi:10.7166/27-2-1119
dc.identifier.issn2224-7890 (online)
dc.identifier.issn1012-277X (print)
dc.identifier.otherdoi:10.7166/27-2-1119
dc.identifier.urihttp://hdl.handle.net/10019.1/102419
dc.descriptionCITATION: Schuurman, J. & Van Vuuren, J. H. 2016. Scheduling sequence-dependent colour printing jobs. South African Journal of Industrial Engineering, 27(2):43-59, doi:10.7166/27-2-1119.
dc.descriptionThe original publication is available at http://sajie.journals.ac.za/pub
dc.description.abstractENGLISH ABSTRACT: 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.en_ZA
dc.description.abstractAFRIKAANSE OPSOMMING: ’n Skeduleringsprobleem uit die kleurdrukwerkbedryf word in hierdie artikel oorweeg. Die probleem vra vir ’n optimale toewysing van take aan elk van ’n versameling kleurdrukkers, sowel as die spesifikasie van ’n optimale volgorde waarin die take wat aan elke drukker toegewys is, uitgevoer moet word. Die doel is om die prosestyd van die drukker wat laaste klaarmaak te minimeer om sodoende ’n aanvaarbare balans tussen die werkladings van die drukkers en die taakvolgorde vir elke drukker te bewerkstellig. ’n Nuwe aspek van die probleem is die manier waarop die opsteltye van die drukkers vir die take volgorde-afhanklik is — dit is moontlik om gemeenskaplikhede tussen die kleure wat vir opeenvolgende take op elke masjien benodig word, uit te buit. Ons los hierdie probleem benaderd op deur gebruik te maak van ’n eenvoudige heuristiek asook drie bekende metaheuristieke. Behalwe vir kleurdrukwerk, het die skeduleringsprobleem wat hier beskou word vele ander toepassings. Sommige van hierdie toepassings word ook kortliks beskryf.af_ZA
dc.description.urihttp://sajie.journals.ac.za/pub/article/view/1119
dc.format.extent17 pages
dc.language.isoen_ZAen_ZA
dc.publisherSouthern African Institute for Industrial Engineering
dc.subjectProduction schedulingen_ZA
dc.subjectPrinting industryen_ZA
dc.subjectProduction controlen_ZA
dc.subjectJob-shop schedulingen_ZA
dc.titleScheduling sequence-dependent colour printing jobsen_ZA
dc.typeArticleen_ZA
dc.description.versionPublisher's version
dc.rights.holderAuthors retain copyright


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

ITEM VIEW