{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:45:31Z","timestamp":1758707131946},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"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":[[2006,6]]},"DOI":"10.1007\/s10951-006-8265-7","type":"journal-article","created":{"date-parts":[[2006,5,7]],"date-time":"2006-05-07T06:25:43Z","timestamp":1146983143000},"page":"299-310","source":"Crossref","is-referenced-by-count":17,"title":["Lot-sizing scheduling with batch setup times"],"prefix":"10.1007","volume":"9","author":[{"given":"Bo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"8265_CR1","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1137\/0222078","volume":"22","author":"B. Chen","year":"1993","unstructured":"Chen, B., \u201cA better heuristic for preemptive parallel machine scheduling with setup times,\u201d SIAM Journal on Computing, 22(6), 1303\u20131318 (1993).","journal-title":"SIAM Journal on Computing"},{"key":"8265_CR2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M. R. Garey","year":"1978","unstructured":"Garey, M. R. and D. S. Johnson, \u201cStrong NP-completeness results: Motivation, examples and implications,\u201d Journal of the Association for Computing Machinery, 25, 499\u2013508 (1978).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"8265_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D. S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness,\u201d Freeman, San Francisco, 1979."},{"key":"8265_CR4","first-page":"287","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, \u201cOptimization and approximation in deterministic sequencing and scheduling: A survey,\u201d Annals of Operations Research, 5, 287\u2013326 (1979).","journal-title":"Annals of Operations Research"},{"issue":"5","key":"8265_CR5","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.41.5.981","volume":"41","author":"C. L. Monma","year":"1993","unstructured":"Monma, C. L. and C. N. Potts, \u201cAnalysis of heuristics for preemptive parallel machine scheduling with batch setup times,\u201d Operations Research, 41(5), 981\u2013993 (1993).","journal-title":"Operations Research"},{"issue":"5","key":"8265_CR6","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1992.66","volume":"43","author":"C. N. Potts","year":"1992","unstructured":"Potts, C. N. and L. N. Van Wassenhove, \u201cIntegrating scheduling with batching and lotsizing: A review of algorithms and complexity\u201d, Journal of the Operational Research Society, 43(5), 395\u2013406 (1992).","journal-title":"Journal of the Operational Research Society"},{"key":"8265_CR7","unstructured":"Schuurman, P. and G. J. Woeginger, \u201cPreemptive scheduling with job-dependent setup times,\u201d ACM-SIAM Symposium on Discrete Algorithms,\u201d 759\u2013767 (1999)."},{"issue":"4","key":"8265_CR8","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1287\/opre.44.4.617","volume":"44","author":"P. Serafini","year":"1996","unstructured":"Serafini, P., \u201cScheduling jobs on several machines with the job splitting property,\u201d Operations Research, 44(4), 617\u2013628 (1996).","journal-title":"Operations Research"},{"issue":"1\u20133","key":"8265_CR9","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. and J. Zhang, \u201cParallel machine scheduling with splitting jobs,\u201d Discrete Applied Mathematics, 103(1\u20133), 259\u2013269 (2000).","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-006-8265-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8265-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8265-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:39Z","timestamp":1559453979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8265-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["8265"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8265-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}