File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A heuristic for the label printing problem

TitleA heuristic for the label printing problem
Authors
KeywordsHeuristic
Label printing
Nonlinear integer programming
Simulating annealing
Issue Date2007
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/cor
Citation
Computers And Operations Research, 2007, v. 34 n. 9, p. 2576-2588 How to Cite?
AbstractLabel printing finds many applications in industry. However, this task is still labor intensive in many printing factories. Since each template can only accommodate a fixed number of labels, an important task is to work out the compositions of templates by allocating suitable labels to each template in order to fulfill the order requirements effectively. The template design could be rather arbitrary, which usually ends up with a lot of excessive printed labels. Enhancing the template design will significantly improve the efficiency of the printing process, and, at the same time, reduce the waste of resources. This motivates the study of more automatic design methods. In this paper, the problem is first formulated as a nonlinear integer programming problem. The main variables in the formulation are the compositions and the printing frequencies of templates. For practical purpose, each type of label is confined to one template only which allows automated packing and handling. The structure of the problems is carefully analyzed and a new algorithm is proposed. Numerical results show that the proposed method is a simple but effective way of generating good template designs. © 2005 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/74427
ISSN
2015 Impact Factor: 1.988
2015 SCImago Journal Rankings: 2.237
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYiu, KFCen_HK
dc.contributor.authorMak, KLen_HK
dc.contributor.authorLau, HYKen_HK
dc.date.accessioned2010-09-06T07:01:13Z-
dc.date.available2010-09-06T07:01:13Z-
dc.date.issued2007en_HK
dc.identifier.citationComputers And Operations Research, 2007, v. 34 n. 9, p. 2576-2588en_HK
dc.identifier.issn0305-0548en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74427-
dc.description.abstractLabel printing finds many applications in industry. However, this task is still labor intensive in many printing factories. Since each template can only accommodate a fixed number of labels, an important task is to work out the compositions of templates by allocating suitable labels to each template in order to fulfill the order requirements effectively. The template design could be rather arbitrary, which usually ends up with a lot of excessive printed labels. Enhancing the template design will significantly improve the efficiency of the printing process, and, at the same time, reduce the waste of resources. This motivates the study of more automatic design methods. In this paper, the problem is first formulated as a nonlinear integer programming problem. The main variables in the formulation are the compositions and the printing frequencies of templates. For practical purpose, each type of label is confined to one template only which allows automated packing and handling. The structure of the problems is carefully analyzed and a new algorithm is proposed. Numerical results show that the proposed method is a simple but effective way of generating good template designs. © 2005 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/coren_HK
dc.relation.ispartofComputers and Operations Researchen_HK
dc.subjectHeuristicen_HK
dc.subjectLabel printingen_HK
dc.subjectNonlinear integer programmingen_HK
dc.subjectSimulating annealingen_HK
dc.titleA heuristic for the label printing problemen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0305-0548&volume=34&issue=9&spage=2576&epage=2588&date=2007&atitle=A+heuristic+for+the+label+printing+problemen_HK
dc.identifier.emailYiu, KFC:cedric@hkucc.hku.hken_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.emailLau, HYK:hyklau@hkucc.hku.hken_HK
dc.identifier.authorityYiu, KFC=rp00206en_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.identifier.authorityLau, HYK=rp00137en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.cor.2005.09.021en_HK
dc.identifier.scopuseid_2-s2.0-33846561183en_HK
dc.identifier.hkuros137079en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33846561183&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume34en_HK
dc.identifier.issue9en_HK
dc.identifier.spage2576en_HK
dc.identifier.epage2588en_HK
dc.identifier.isiWOS:000245254500004-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridYiu, KFC=24802813000en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridLau, HYK=7201497761en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats