Abstract
We consider the problem of scheduling independent jobs on identical parallel machines to minimize the total completion time. Each job has a set of eligible machines and a given release date, and all jobs have equal processing times. For the problem with a fixed number of machines, we determine its computational complexity by providing a polynomial time dynamic programming algorithm. We also present two polynomial time approximation algorithms along with their worst case analyses. Experiments with randomly generated instances show that the proposed algorithms consistently generate schedules that are very close to optimal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., et al. (1999) Approximation schemes for minimizing average weighted completion time with release dates. In 40th annual symposium on foundations of computer science, Piscataway: IEEE (pp. 32–43).
Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004). Ten notes on equal-processing-time scheduling. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2(2), 111–127.
Brucker, P., Jurisch, B., & Krämer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research, 70, 57–73.
Brucker, P., & Kravchenko, S. A. (2005). Scheduling jobs with release times on parallel machines to minimize total tardiness. Fachbereich Mathematik/Informatik: Universität Osnabrück.
Brucker, P., & Kravchenko, S. A. (2008). Scheduling jobs with equal processing times and time windows on identical parallel machines. Journal of Scheduling, 11(4), 229–237.
Bruno, J., Coffman, E. G, Jr., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382–387.
Glass, C. A., & Mills, H. (2006). Scheduling unit length jobs with parallel nested machine processing set restrictions. Computers & Operations Research, 33(3), 620–638.
Hochbaum, D. S. (1996). Approximation algorithms for NP-hard problems. Berlin: PWS Publishing Co.
Horn, W. (1973). Minimizing average flow time with parallel machines. Operations Research, 21(3), 846–847.
Hwang, H. C., Chang, S. Y., & Lee, K. (2004). Parallel machine scheduling under a grade of service provision. Computers & Operations Research, 31(12), 2055–2061.
Im, S., & Li, S. (2017). Better unrelated machine scheduling for weighted completion time via random sets from non-uniform distributions. In Proceedings of the 13th workshop on models and algorithms for planning and scheduling problems (MAPSP)
Keha, A. B., Khowala, K., & Fowler, J. W. (2009). Mixed integer programming formulations for single machine scheduling problems. Computers & Industrial Engineering, 56(1), 357–367.
Kravchenko, S. A., & Werner, F. (2011). Parallel machine problems with equal processing times: a survey. Journal of Scheduling, 14(5), 435–444.
Lee, K., Leung, J. Y. T., & Pinedo, M. L. (2011). Scheduling jobs with equal processing times subject to machine eligibility constraints. Journal of Scheduling, 14(1), 27–38.
Lenstra, J. K., Kan, A. R., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics (Vol. 1, pp. 343–362). Amsterdam: Elsevier.
Leung, J. Y. T., & Li, C. L. (2008). Scheduling with processing set restrictions: A survey. International Journal of Production Economics, 116(2), 251–262.
Li, C. L. (2006). Scheduling unit-length jobs with machine eligibility restrictions. European Journal of Operational Research, 174(2), 1325–1328.
Li, S. (2017). Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. In IEEE 58th annual symposium on foundations of computer science (FOCS).
Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems. Berlin: Springer.
Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12(2), 294–299.
Skutella, M. (2001). Convex quadratic and semidefinite programming relaxations in scheduling. Journal of the ACM (JACM), 48(2), 206–242.
Acknowledgements
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government [grant number NRF-2017R1A2B4011486].
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hong, J., Lee, K. & Pinedo, M.L. Scheduling equal length jobs with eligibility restrictions. Ann Oper Res 285, 295–314 (2020). https://doi.org/10.1007/s10479-019-03172-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-019-03172-8