Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1081
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorWang, X-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:26:59Z-
dc.date.available2014-12-11T08:26:59Z-
dc.identifier.issn0305-0548-
dc.identifier.urihttp://hdl.handle.net/10397/1081-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.rightsComputers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectFlowshop schedulingen_US
dc.subjectApproximation schemeen_US
dc.subjectAvailability constrainten_US
dc.titleAn approximation scheme for two-machine flowshop scheduling with setup times and an availability constrainten_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage2894-
dc.identifier.epage2901-
dc.identifier.volume34-
dc.identifier.issue10-
dc.identifier.doi10.1016/j.cor.2005.11.019-
dcterms.abstractThis paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationComputers and operations research, Oct. 2007, v. 34, no. 10, p. 2894-2901-
dcterms.isPartOfComputers and operations research-
dcterms.issued2007-10-
dc.identifier.isiWOS:000245878600003-
dc.identifier.scopus2-s2.0-33847638481-
dc.identifier.eissn1873-765X-
dc.identifier.rosgroupidr32120-
dc.description.ros2006-2007 > 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 
A PTAS for Twomachine Flowshop Scheduling v4.pdfPre-published version178.83 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

175
Last Week
0
Last month
Citations as of Apr 14, 2024

Downloads

168
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


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