{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:09:25Z","timestamp":1648739365201},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,2,3]],"date-time":"2012-02-03T00:00:00Z","timestamp":1328227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11590-012-0449-9","type":"journal-article","created":{"date-parts":[[2012,2,7]],"date-time":"2012-02-07T13:27:18Z","timestamp":1328621238000},"page":"1071-1086","source":"Crossref","is-referenced-by-count":3,"title":["Optimal sequencing of a set of positive numbers with the variance of the sequence\u2019s partial sums maximized"],"prefix":"10.1007","volume":"7","author":[{"given":"Li","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wangdong","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dingxing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"En","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,3]]},"reference":[{"issue":"9","key":"449_CR1","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","volume":"18","author":"A.G. Merten","year":"1972","unstructured":"Merten A.G., Muller M.E.: Variance minimization in single machine sequencing problems. Manag. Sci. 18(9), 518\u2013528 (1972)","journal-title":"Manag. Sci."},{"issue":"5","key":"449_CR2","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","volume":"21","author":"L. Schrage","year":"1975","unstructured":"Schrage L.: Minimizing the time-in-system variance for a finite jobset. Manag. Sci. 21(5), 540\u2013543 (1975)","journal-title":"Manag. Sci."},{"issue":"8","key":"449_CR3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/0167-6377(91)90024-J","volume":"10","author":"N.G. Hall","year":"1991","unstructured":"Hall N.G., Kubiak W.: Proof of a conjecture of Schrage about the completion time variance problem. Oper. Res. Lett. 10(8), 467\u2013472 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"449_CR4","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","volume":"23","author":"S. Eilon","year":"1977","unstructured":"Eilon S., Chowdhury I.G.: Minimizing waiting time variance in the single machine problem. Manag. Sci. 23(6), 567\u2013575 (1977)","journal-title":"Manag. Sci."},{"issue":"1","key":"449_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","volume":"14","author":"W. Kubiak","year":"1993","unstructured":"Kubiak W.: Completion time variance minimization on a single machine is difficult. Oper. Res. Lett. 14(1), 49\u201359 (1993)","journal-title":"Oper. Res. Lett."},{"key":"449_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(96)80468-9","volume":"70","author":"T.C.E. Cheng","year":"1996","unstructured":"Cheng T.C.E., Kovalyov M.Y.: Batch scheduling and common due-date assignment on a single machine. Discrete Appl. Math. 70, 231\u2013245 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"449_CR7","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1016\/S0305-0548(02)00062-X","volume":"30","author":"G. Viswanathkumar","year":"2003","unstructured":"Viswanathkumar G., Srinivasan G.: A branch and bound algorithm to minimize completion time variance on a single processor. Comput. Oper. Res. 30(8), 1135\u20131150 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"449_CR8","doi-asserted-by":"crossref","first-page":"3069","DOI":"10.1016\/j.cor.2005.11.015","volume":"34","author":"N. Ye","year":"2007","unstructured":"Ye N., Li X., Farley T., Xu X.: Job scheduling methods for reducing waiting time variance. Comput. Oper. Res. 34(10), 3069\u20133083 (2007)","journal-title":"Comput. Oper. Res."},{"key":"449_CR9","doi-asserted-by":"crossref","unstructured":"Maroti, M., Kusy, B., Balogh, G., Volgyesi, P., Nadas, A., Molnar, K., Dora, S., Ledeczi, A.: Radio interferometric geolocation. In: Proceedings of 3rd ACM International Conference on Embedded Networked Sensor Systems (SenSys) (2005)","DOI":"10.1145\/1098918.1098920"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0449-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0449-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0449-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T05:13:35Z","timestamp":1561266815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0449-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,3]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["449"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0449-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,3]]}}}