{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:39:29Z","timestamp":1759667969692,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T00:00:00Z","timestamp":1534550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["2"],"award-info":[{"award-number":["2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10951-018-0584-y","type":"journal-article","created":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T16:23:20Z","timestamp":1534609400000},"page":"413-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs"],"prefix":"10.1007","volume":"22","author":[{"given":"Hui-Chih","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand M. T.","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-Min","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,18]]},"reference":[{"key":"584_CR1","unstructured":"Amazon.com (2017). Amazon Web Services. Accessed January 16, 2017 from https:\/\/aws.amazon.com\/?nc1=h_ls ."},{"key":"584_CR2","volume-title":"Handbook on scheduling: From theory to applications","author":"J B\u0142a\u017cewicz","year":"2007","unstructured":"B\u0142a\u017cewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & W\u0229glarz, J. (2007). Handbook on scheduling: From theory to applications. Berlin: Springer."},{"key":"584_CR3","unstructured":"Chen, B., Potts, C. N., & Woeginger, G. J. (1998). A review of machine scheduling: Complexity, algorithms and approximability. In Handbook of combinatorial optimization (pp. 1493\u20131641). New York: Springer."},{"issue":"3","key":"584_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90215-W","volume":"47","author":"TCE Cheng","year":"1990","unstructured":"Cheng, T. C. E., & Sin, C. C. (1990). A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47(3), 271\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"584_CR5","volume-title":"Operating system concepts","author":"PB Galvin","year":"2013","unstructured":"Galvin, P. B., Gagne, G., & Silberschatz, A. (2013). Operating system concepts. New York: Wiley."},{"key":"584_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnoy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"584_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M. R., & Johnson, D. S. (1978). \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. Journal of the Association of Computing Machinery, 25(3), 499\u2013508.","journal-title":"Journal of the Association of Computing Machinery"},{"issue":"3","key":"584_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/moor.3.3.197","volume":"3","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O. H., & Kim, C. E. (1978). Approximation algorithms for certain scheduling problems. Mathematics of Operations Research, 3(3), 197\u2013204.","journal-title":"Mathematics of Operations Research"},{"key":"584_CR9","unstructured":"Lawler, E. L. (1979). Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Report BW 105, Centre for Mathematics and Computer Science, Amsterdam."},{"key":"584_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical programming: The State of the Art (Bonn, 1982)","author":"EL Lawler","year":"1983","unstructured":"Lawler, E. L. (1983). Recent results in the theory of machine scheduling. In A. Bachem, M. Groetschel, & B. Korte (Eds.), Mathematical programming: The State of the Art (Bonn, 1982) (pp. 202\u2013234). Berlin: Springer."},{"issue":"2","key":"584_CR11","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/opre.37.2.314","volume":"37","author":"EL Lawler","year":"1989","unstructured":"Lawler, E. L., & Martel, C. U. (1989). Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research, 37(2), 314\u2013318.","journal-title":"Operations Research"},{"issue":"1","key":"584_CR12","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2014.03.026","volume":"238","author":"K Lee","year":"2014","unstructured":"Lee, K., Leung, J. Y. T., Jia, Z. H., Li, W., Pinedo, M. L., & Lin, B. M. T. (2014). Fast approximation algorithms for bi-criteria scheduling with machine assignment costs. European Journal of Operational Research, 238(1), 54\u201364.","journal-title":"European Journal of Operational Research"},{"key":"584_CR13","doi-asserted-by":"crossref","unstructured":"Leung, J. Y. (Ed.). (2004). Handbook of scheduling: Algorithms, models, and performance analysis. Boca Raton, FL: CRC Press.","DOI":"10.1201\/9780203489802"},{"issue":"1","key":"584_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1\u201312.","journal-title":"Management Science"},{"key":"584_CR15","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff, E. (2001). Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 18, 193\u2013242.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"584_CR16","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An $$n$$ n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102\u2013109.","journal-title":"Management Science"},{"key":"584_CR17","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2015","unstructured":"Pinedo, M. L. (2015). Scheduling: Theory, algorithms, and systems. New York: Springer."},{"issue":"3","key":"584_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.ejor.2013.05.041","volume":"231","author":"D Prot","year":"2013","unstructured":"Prot, D., Bellenguez-Morineau, O., & Lahlou, C. (2013). New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria. European Journal of Operational Research, 231(3), 282\u2013287.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"584_CR19","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/322203.322214","volume":"27","author":"S Sahni","year":"1980","unstructured":"Sahni, S., & Cho, Y. (1980). Scheduling independent tasks with due time on a uniform processor system. Journal of the Association for Computing Machinery, 27(3), 550\u2013563.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"2","key":"584_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10723-015-9359-2","volume":"14","author":"S Singh","year":"2016","unstructured":"Singh, S., & Chana, J. (2016). A survey on resource scheduling in cloud computing: Issues and challenges. Journal of Grid Computing, 14(2), 217\u2013264.","journal-title":"Journal of Grid Computing"},{"issue":"1","key":"584_CR21","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/mnsc.17.1.116","volume":"17","author":"LBJM Sturm","year":"1970","unstructured":"Sturm, L. B. J. M. (1970). A simple optimality proof of Moore\u2019s sequencing algorithm. Management Science, 17(1), 116\u2013118.","journal-title":"Management Science"},{"key":"584_CR22","volume-title":"Modern Operating Systems","author":"AS Tanenbaum","year":"2014","unstructured":"Tanenbaum, A. S., & Bos, H. (2014). Modern Operating Systems. New Jersey: Prentice Hall Press."},{"issue":"5","key":"584_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/74851.74866","volume":"23","author":"A Tucker","year":"1989","unstructured":"Tucker, A., & Gupta, A. (1989). Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. ACM SIGOPS Operating Systems Review, 23(5), 159\u2013166.","journal-title":"ACM SIGOPS Operating Systems Review"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0584-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0584-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0584-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T19:29:25Z","timestamp":1661801365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0584-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,18]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["584"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0584-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,8,18]]},"assertion":[{"value":"18 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}