Abstract
This paper addresses a recent open scheduling problem which aims to minimize the summation of total weighted completion time and the total machine time slot cost. Focusing on the case of non-increasing time slot cost with non-preemptive jobs, we show that the problem can be solved in polynomial-time when the time slot cost decreases with certain patterns, including linearly decreasing, decreasing concave, and decreasing convex cases. Different methodologies are used for three cases. For the linearly decreasing case, we can classify all the jobs into three categories and schedule the job sets one by one. For the decreasing concave case, we calculate each job’s worst starting time and try to make them far away from their worst starting times. For the decreasing concave case, we calculate each job’s best starting time and let them start close to their best starting times. Finally, we show that the problem is NP-hard in the strong sense when the time slot cost decreases in an arbitrary way.
Similar content being viewed by others
References
Aydinliyim, T., & Vairaktarakis, G. L. (2010). Coordination of outsourced operations to minimize weighted flow time and capacity booking costs. Manufacturing and Service Operations Management, 12(2), 236–255.
Chen, L., Megow, N., Rischke, R., Stougie, L., & Verschae, J. (2015). Optimal algorithms and a PTAS for cost-aware scheduling. MFCS 2015.
Garey, M. R., & Johnson, D. S. (1978). “Strong” NP-completeness results: Motivation, examples, and implications. Journal of ACM, 25, 499–508.
Kulkarni, J. & Munagala, K. (2012). Algorithms for cost aware scheduling: Proceedings of 10th International Workshop on Approximation and Online Algorithms (WAOA 2012) (pp. 201–214).
Pinedo, M. (2012). Scheduling: theory, algorithms, and systems. Heidelberg: Springer.
Wan, G., & Qi, X. (2010). Scheduling with variable time slot costs. Naval Research Logistics, 57, 159–171.
Zhong, W., & Liu, X. (2012). A single machine scheduling problem with time slot costs. Recent advances in computer science and information engineering. Heidelberg: Springer.
Acknowledgments
This work was fully supported by grants from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 117913 and Project No. 16208214].
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhao, Y., Qi, X. & Li, M. On scheduling with non-increasing time slot cost to minimize total weighted completion time. J Sched 19, 759–767 (2016). https://doi.org/10.1007/s10951-015-0462-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-015-0462-9