{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:40:54Z","timestamp":1775068854656,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T00:00:00Z","timestamp":1392681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10951-014-0370-4","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T13:56:45Z","timestamp":1392645405000},"page":"119-129","source":"Crossref","is-referenced-by-count":9,"title":["Split scheduling with uniform setup times"],"prefix":"10.1007","volume":"18","author":[{"given":"Frans","family":"Schalekamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Sitters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suzanne","family":"van der Ster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00edctor","family":"Verdugo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anke","family":"van Zuylen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"370_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., & Sviridenko, M. (1999). Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of 40th Annual Symposium on Foundations of Computer Science (pp. 32\u201343).","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"370_CR2","doi-asserted-by":"crossref","unstructured":"Bruno, J., Coffman, E.G., Jr., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382\u2013387.","DOI":"10.1145\/361011.361064"},{"issue":"3","key":"370_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10951-006-8265-7","volume":"9","author":"B Chen","year":"2006","unstructured":"Chen, B., Ye, Y., & Zhang, J. (2006). Lot-sizing scheduling with batch setup times. Journal of Scheduling, 9(3), 299\u2013310.","journal-title":"Journal of Scheduling"},{"key":"370_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84882-310-5","volume-title":"Scheduling for parallel processing","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M. (2009). Scheduling for parallel processing (1st ed.). London: Springer.","edition":"1"},{"key":"370_CR5","doi-asserted-by":"crossref","unstructured":"Du, J., Leung, J.Y.-T., & Young, G.B. (1990). Minimizing mean flow time with release time constraint. Theoretical Computer Science, 75(3), 355\u2013374.","DOI":"10.1016\/0304-3975(90)90100-V"},{"issue":"2","key":"370_CR6","doi-asserted-by":"crossref","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., & Kan, A. H. G. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(2), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"370_CR7","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K. (1998). The mystical power of twoness: In memoriam Eugene L Lawler. Journal of Scheduling, 1(1), 3\u201314.","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<3::AID-JOS1>3.0.CO;2-B"},{"key":"370_CR8","doi-asserted-by":"crossref","unstructured":"Liu, Z., & Cheng, T.C.E. (2004). Minimizing total completion time subject to job release dates and preemption penalties. Journal of Scheduling, 7(4), 313\u2013327.","DOI":"10.1023\/B:JOSH.0000031424.35504.c4"},{"issue":"5","key":"370_CR9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity. The Journal of the Operational Research Society, 43(5), 395\u2013406.","journal-title":"The Journal of the Operational Research Society"},{"key":"370_CR10","unstructured":"Schuurman, P., & Woeginger, G.J. (1999). Preemptive scheduling with job-dependent setup times. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (pp. 759\u2013767). Society for Industrial and Applied Mathematics."},{"key":"370_CR11","unstructured":"Van der Ster, S. (2010). The allocation of scarce resources in disaster relief, 2010. M.Sc. Thesis in Operations Research at VU University Amsterdam."},{"issue":"1\u20133","key":"370_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W Xing","year":"2000","unstructured":"Xing, W., & Zhang, J. (2000). Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103(1\u20133), 259\u2013269.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0370-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0370-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0370-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0370-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["370"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0370-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}