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
Title: Task scheduling with progress control
Authors: Li, CL 
Zhong, W
Issue Date: 2018
Source: IISE transactions, 2018, v. 50, no. 1, p. 54-61
Abstract: Tasks 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.
Keywords: Multi-tasking
Polynomial-time algorithm
Progress milestones
Scheduling
Publisher: Taylor & Francis
Journal: IISE transactions 
ISSN: 2472-5854
EISSN: 2472-5862
DOI: 10.1080/24725854.2017.1380334
Rights: Copyright © 2018 "IISE"
This 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.
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 full item record

Page views

66
Last Week
2
Last month
Citations as of May 15, 2022

Downloads

47
Citations as of May 15, 2022

SCOPUSTM   
Citations

2
Citations as of May 20, 2022

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
Citations as of May 19, 2022

Google ScholarTM

Check

Altmetric


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