{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:46Z","timestamp":1759847326038},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,11,28]],"date-time":"2012-11-28T00:00:00Z","timestamp":1354060800000},"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":[[2013,6]]},"DOI":"10.1007\/s10951-012-0297-6","type":"journal-article","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T08:49:39Z","timestamp":1354178979000},"page":"337-346","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times"],"prefix":"10.1007","volume":"16","author":[{"given":"M\u00e1rton","family":"Dr\u00f3tos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,28]]},"reference":[{"key":"297_CR1","doi-asserted-by":"crossref","unstructured":"Boysen, N., Bock, S., & Fliedner. M. (2012). Scheduling of inventory releasing jobs to satisfy time-varying demand: An analysis of complexity. Journal of Scheduling (to appear). doi: 10.1007\/s10951-012-0266-0 .","DOI":"10.1007\/s10951-012-0266-0"},{"key":"297_CR2","doi-asserted-by":"crossref","unstructured":"Briskorn, D., Choi, B. C., Lee, K., Leung, J., & Pinedo, M. (2010). Complexity of single machine scheduling subject to nonnegative inventory constraints. European Journal of Operational Research, 207, 605\u2013619. doi: 10.1016\/j.ejor.2010.05.036 .","DOI":"10.1016\/j.ejor.2010.05.036"},{"key":"297_CR3","doi-asserted-by":"crossref","unstructured":"Briskorn, D., Jaehn, F., & Pesch, E. (2011). Exact algorithms for inventory constrained scheduling on a single machine. Journal of scheduling (to appear). doi: 10.1007\/s10951-011-0261-x .","DOI":"10.1007\/s10951-011-0261-x"},{"key":"297_CR4","doi-asserted-by":"crossref","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., & Pisinger, D. (2000). Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research, 123, 333\u2013345.","DOI":"10.1016\/S0377-2217(99)00261-1"},{"key":"297_CR5","doi-asserted-by":"crossref","unstructured":"Carlier, J., & Rinnooy Kan, A. H. G. (1982). Scheduling subject to nonrenewable resource constraints. Operations Research Letters, 1, 52\u201355.","DOI":"10.1016\/0167-6377(82)90045-1"},{"key":"297_CR6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/B978-0-444-87358-3.50013-4","volume-title":"Advances in project scheduling","author":"J Carlier","year":"1989","unstructured":"Carlier, J. (1989). Scheduling under financial constraints. In R. Slowi\u0144ski & J. Weglarz (Eds.), Advances in project scheduling (pp. 187\u2013224). Amsterdam: Elsevier."},{"key":"297_CR7","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"297_CR8","doi-asserted-by":"crossref","unstructured":"Grigoriev, A., Holthuijsen, M., & van de Klundert, J. (2005). Basic Scheduling Problems with Raw Material Constraints. Naval Research Logistics, 52, 527\u2013535. doi: 10.1002\/nav.20095 .","DOI":"10.1002\/nav.20095"},{"key":"297_CR9","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Kotov, V., Rendl, F., & Woeginger, G. J. (1998). The Stock Size Problem. Operations Research, 46, S1\u2013S12.","DOI":"10.1287\/opre.46.3.S1"},{"key":"297_CR10","doi-asserted-by":"crossref","unstructured":"Neumann, K., & Schwindt, C. (2002). Project scheduling with inventory constraints. Mathematical Methods of Operations Research, 56, 513\u2013533.","DOI":"10.1007\/s001860200251"},{"key":"297_CR11","unstructured":"Schuurman, P., & Woeginger, G. J. Approximation schemes: A tutorial. In R. Moehring, C. Potts, A. Schulz, G. Woeginger, & L. Wolsey (Eds.), Lectures on scheduling (to appear)."},{"key":"297_CR12","unstructured":"Ziegelmann, M. (2001). Constrained shortest paths and related problems. PhD thesis, Universit\u00e4t des Saarlandes, Homburg\/Saar, Germany."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0297-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0297-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0297-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:47Z","timestamp":1559453987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0297-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,28]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0297-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,28]]}}}