Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/663
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorShakhlevich, NV-
dc.date.accessioned2014-12-11T08:27:47Z-
dc.date.available2014-12-11T08:27:47Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/663-
dc.descriptionNote: Pre-published version entitled: Minimizing Nondecreasing separable objective functions for the unit-time open shop scheduling problem. Project Management and Scheduling.en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectOpen shop schedulingen_US
dc.subjectParallel machine schedulingen_US
dc.subjectSeparable non-decreasing functionen_US
dc.titleMinimizing non-decreasing separable objective functions for the unit-time open shop scheduling problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage444-
dc.identifier.epage456-
dc.identifier.volume165-
dc.identifier.issue2-
dc.identifier.doi10.1016/j.ejor.2004.04.014-
dcterms.abstractIn this paper we study both the non-preemptive and preemptive versions of the popular unit-time open shop scheduling problem. For the set of feasible schedules which satisfy a predetermined order of job completion times, we construct the linear description of the convex hull of the vectors of the job completion times. Based on the properties of the resulting scheduling polyhedron, we show that the problem of constructing an optimal schedule minimizing an arbitrary non-decreasing separable cost function of job completion times is polynomially solvable.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 1 Sept. 2005, v. 165, no. 2, p. 444-456-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2005-09-01-
dc.identifier.isiWOS:000227660900014-
dc.identifier.scopus2-s2.0-13444266100-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr25138-
dc.description.ros2004-2005 > 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 
uet.pdfPre-published version189.23 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

104
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

196
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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