Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1842
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorLi, CL-
dc.creatorMosheiov, G-
dc.creatorYovel, U-
dc.date.accessioned2014-12-11T08:25:30Z-
dc.date.available2014-12-11T08:25:30Z-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10397/1842-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rightsComputers & Operations Research © 2007 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectAnalysis of algorithmsen_US
dc.subjectDue-date assignmenten_US
dc.subjectEarliness–tardinessen_US
dc.subjectSchedulingen_US
dc.titleAn efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobsen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationDepartment of Logisticsen_US
dc.identifier.spage3612-
dc.identifier.epage3619-
dc.identifier.volume35-
dc.identifier.issue11-
dc.identifier.doi10.1016/j.cor.2007.03.006-
dcterms.abstractWe consider a single-machine scheduling problem with equal-sized jobs. The objective is to minimize the maximum weighted earliness–tardiness and due-date costs. We present an algorithm to solve this problem. Our algorithm makes use of bottleneck jobs and priority queues, and has a computational complexity of O(n⁴logn). This complexity is a significant improvement of the existing algorithm in the literature.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationComputers and operations research, Nov. 2008, v. 35, no. 11, p. 3612-3619-
dcterms.isPartOfComputers and operations research-
dcterms.issued2008-11-
dc.identifier.isiWOS:000255671800014-
dc.identifier.scopus2-s2.0-41149134008-
dc.identifier.eissn1873-765X-
dc.identifier.rosgroupidr44843-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
55 Final-Version.pdfPre-published version182.84 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

121
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

184
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

6
Last Week
0
Last month
0
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.