{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T12:30:19Z","timestamp":1774355419230,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,9]],"date-time":"2014-01-09T00:00:00Z","timestamp":1389225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10479-013-1522-1","type":"journal-article","created":{"date-parts":[[2014,1,8]],"date-time":"2014-01-08T02:26:07Z","timestamp":1389147967000},"page":"479-490","source":"Crossref","is-referenced-by-count":7,"title":["Supply chain scheduling to minimize holding costs with outsourcing"],"prefix":"10.1007","volume":"217","author":[{"given":"Esaignani","family":"Selvarajah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,9]]},"reference":[{"issue":"15","key":"1522_CR1","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.dam.2005.04.019","volume":"154","author":"A. Agnetis","year":"2006","unstructured":"Agnetis, A., Hall, N. G., & Pacciarelli, D. (2006). Supply chain scheduling: sequence coordination. Discrete Applied Mathematics, 154(15), 2044\u20132063.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1522_CR2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"Z.-L. Chen","year":"2010","unstructured":"Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: review and extensions. Operations Research, 58(1), 130\u2013148.","journal-title":"Operations Research"},{"key":"1522_CR3","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1287\/opre.1070.0412","volume":"55","author":"Z.-L. Chen","year":"2007","unstructured":"Chen, Z.-L., & Hall, N. G. (2007). Supply chain scheduling: conflict and cooperation in assembly systems. Operations Research, 55, 1072\u20131089.","journal-title":"Operations Research"},{"key":"1522_CR4","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1287\/mnsc.1040.0325","volume":"51","author":"Z.-L. Chen","year":"2005","unstructured":"Chen, Z.-L., & Vairaktarakis, G. L. (2005). Integrated scheduling of production and distribution operations. Management Science, 51, 614\u2013628.","journal-title":"Management Science"},{"issue":"7","key":"1522_CR5","doi-asserted-by":"crossref","first-page":"3711","DOI":"10.1109\/GLOCOM.2003.1258926","volume":"2003","author":"G. Cheng","year":"2003","unstructured":"Cheng, G., & Ansari, N. (2003). A new heuristics for finding the delay constrained least cost path. IEEE Global Telecommunications Conference (GLOBECOM\u201903), 2003(7), 3711\u20133715.","journal-title":"IEEE Global Telecommunications Conference (GLOBECOM\u201903)"},{"issue":"1","key":"1522_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"D. W. Engels","year":"2003","unstructured":"Engels, D. W., Karger, D. R., Kolliopoulos, S. G., Sengupta, S., Uma, R. N., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49(1), 175\u2013191.","journal-title":"Journal of Algorithms"},{"key":"1522_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman. 1979."},{"key":"1522_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"1522_CR9","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1287\/opre.51.4.566.16106","volume":"51","author":"N. G. Hall","year":"2003","unstructured":"Hall, N. G., & Potts, C. N. (2003). Supply chain scheduling, batching and delivery. Operations Research, 51(4), 566\u2013584.","journal-title":"Operations Research"},{"issue":"1","key":"1522_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1), 36\u201342.","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"1522_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-6377(82)90022-0","volume":"1","author":"E. L. Lawler","year":"1982","unstructured":"Lawler, E. L. (1982). A fully polynomial time approximation scheme for the total tardiness problem. Operations Research Letters, 1(6), 207\u2013208.","journal-title":"Operations Research Letters"},{"key":"1522_CR12","volume-title":"Several states related to state procurements","author":"McKenna Long & Aldridge LLP","year":"2004","unstructured":"McKenna Long & Aldridge LLP (2004). Recent budget provision limits offshoring of jobs under outsourced federal contracts: legislation introduced. In Several states related to state procurements. www.mckennalong.com ."},{"issue":"1","key":"1522_CR13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/TASE.2006.887159","volume":"5","author":"X. T. Qi","year":"2008","unstructured":"Qi, X. T. (2008). Coordinated logistics scheduling for in-house production and outsourcing. IEEE Transactions on Automation Science and Engineering, 5(1), 188\u2013192.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"2","key":"1522_CR14","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/opre.1080.0622","volume":"57","author":"E. Selvarajah","year":"2009","unstructured":"Selvarajah, E., & Steiner, G. (2009). Approximation algorithms for the supplier\u2019s supply chain scheduling problem to minimize delivery and inventory holding costs. Operations Research, 57(2), 426\u2013438.","journal-title":"Operations Research"},{"key":"1522_CR15","author":"E. Selvarajah","year":"2011","unstructured":"Selvarajah, E., Steiner, G., & Zhang, R. (2011). Single machine batch scheduling with release times and delivery costs. Journal of Scheduling. Online FirstTM. doi: 10.1007\/s10951-011-0255-8 .","journal-title":"Journal of Scheduling"},{"key":"1522_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D. Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of Scheduling, 16, 2\u2013282.","journal-title":"Journal of Scheduling"},{"issue":"13","key":"1522_CR17","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"1522_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"6","key":"1522_CR19","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1287\/opre.1110.0948","volume":"59","author":"G. Steiner","year":"2011","unstructured":"Steiner, G., & Zhang, R. (2011). Revised delivery-time quotation in scheduling with tardiness penalties. Operations Research, 59(6), 1504\u20131511.","journal-title":"Operations Research"},{"key":"1522_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(96)00098-7","volume":"94","author":"D. J. Thomas","year":"1996","unstructured":"Thomas, D. J., & Griffin, P. M. (1996). Coordinated supply chain management. European Journal of Operational Research, 94, 1\u201315.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1522_CR21","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ejor.2007.12.033","volume":"194","author":"X. L. Wang","year":"2009","unstructured":"Wang, X. L., & Cheng, T. C. E. (2009). Production scheduling with supply and delivery considerations to minimize the makespan. European Journal of Operational Research, 194(3), 743\u2013752.","journal-title":"European Journal of Operational Research"},{"issue":"16\u201318","key":"1522_CR22","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L. Q. Zhang","year":"2010","unstructured":"Zhang, L. Q., Lu, L. F., & Yuan, J. J. (2010). Single-machine scheduling under the job rejection constraint. Theoretical Computer Science, 411(16\u201318), 1877\u20131882.","journal-title":"Theoretical Computer Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1522-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-013-1522-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-013-1522-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T19:48:13Z","timestamp":1565034493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-013-1522-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,9]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["1522"],"URL":"https:\/\/doi.org\/10.1007\/s10479-013-1522-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,9]]}}}