349
Views
5
CrossRef citations to date
0
Altmetric
Scheduling & Logistics

Task scheduling with progress control

&
Pages 54-61 | Received 18 Feb 2017, Accepted 07 Sep 2017, Published online: 04 Dec 2017
 

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.

Acknowledgements

The authors thank two anonymous referees for their helpful comments.

Funding

This research was supported in part by the Research Grants Council of Hong Kong under grant PolyU5195/13E.

Additional information

Notes on contributors

Chung-Lun Li

Chung-Lun Li is Chair Professor of Logistics Management at The Hong Kong Polytechnic University. He received his doctoral degree in Operations Research from Columbia University. His areas of interest are logistics, scheduling, supply chain management, and combinatorial optimization. His publications have appeared in IISE Transactions, Management Science, Naval Research Logistics, Operations Research, and Production and Operations Management.

Weiya Zhong

Weiya Zhong is an Associate Professor in the Department of Business Administration, School of Management, at Shanghai University. She received her doctoral degree from the Department of Mathematics at Zhejiang University, China. Her areas of interest are scheduling, combinatorial optimization, and operations management. Her publications have appeared in European Journal of Operational Research, Operations Research Letters, Journal of Combinatorial Optimization, and Journal of Scheduling.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 202.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.