Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/77034
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorLi, CL-
dc.creatorZhong, W-
dc.date.accessioned2018-07-19T04:46:22Z-
dc.date.available2018-07-19T04:46:22Z-
dc.identifier.issn2472-5854-
dc.identifier.urihttp://hdl.handle.net/10397/77034-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.rightsCopyright © 2018 "IISE"en_US
dc.rightsThis is an Accepted Manuscript of an article published by Taylor & Francis in IISE Transactions on 04 Dec 2017 (Published online), available online: http://www.tandfonline.com/10.1080/24725854.2017.1380334.en_US
dc.subjectMulti-taskingen_US
dc.subjectPolynomial-time algorithmen_US
dc.subjectProgress milestonesen_US
dc.subjectSchedulingen_US
dc.titleTask scheduling with progress controlen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage54-
dc.identifier.epage61-
dc.identifier.volume50-
dc.identifier.issue1-
dc.identifier.doi10.1080/24725854.2017.1380334-
dcterms.abstractTasks with long durations often face the requirement of having to periodically report their progress to process controllers. Under this requirement, working teams that simultaneously process multiple tasks need to schedule their work carefully in order to demonstrate satisfactory progress on each unfinished task. We present a single-machine scheduling model that reflects this requirement. Our model has multiple milestones at which the tasks are penalized if their progress is below a satisfactory level. We develop polynomial solution methods for the general case with convex nonlinear penalty functions and for the special case with linear penalty functions. Extensions of our model are also discussed.-
dcterms.accessRightsopen access-
dcterms.bibliographicCitationIISE transactions, 2018, v. 50, no. 1, p. 54-61-
dcterms.isPartOfIISE transactions-
dcterms.issued2018-
dc.identifier.scopus2-s2.0-85038212746-
dc.identifier.eissn2472-5862-
dc.identifier.rosgroupid2017001661-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201807 bcrc-
dc.description.oaAccepted Manuscript-
dc.identifier.FolderNumbera0704-n03-
dc.identifier.SubFormID1050-
dc.description.fundingSourceRGC-
dc.description.fundingTextPolyU5195/13E-
dc.description.pubStatusPublished-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
a0704-n03_1050_Li18.pdfPre-Published version763.03 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

101
Last Week
0
Last month
Citations as of Apr 21, 2024

Downloads

115
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

5
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

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

Google ScholarTM

Check

Altmetric


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