{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T22:28:10Z","timestamp":1660256890664},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1016\/0167-6377(94)90079-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"205-211","source":"Crossref","is-referenced-by-count":1,"title":["A quadratic integer programming method for minimizing the mean squared deviation of completion times"],"prefix":"10.1016","volume":"15","author":[{"given":"Michael X.","family":"Weng","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Ventura","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90079-5_BIB1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Agmon","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/0167-6377(94)90079-5_BIB2","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing mean squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB3","series-title":"Annals of Opns. Res. 13: Fortran Codes for Network Optimization","article-title":"Algorithms and codes for the assignment problem","author":"Carpaneto","year":"1988"},{"key":"10.1016\/0167-6377(94)90079-5_BIB4","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.35.9.1143","article-title":"A note on the minimization of mean squared deviation of completion times about a common due date","volume":"35","author":"De","year":"1989","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0305-0548(90)90046-A","article-title":"Scheduling about a common due date with earliness and tardiness penalties","volume":"17","author":"De","year":"1990","journal-title":"Computers Opns. Res."},{"key":"10.1016\/0167-6377(94)90079-5_BIB6","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1287\/opre.40.6.1148","article-title":"On the minimization of completion time variance with a bicriteria extension","volume":"40","author":"De","year":"1992","journal-title":"Opns. Res."},{"key":"10.1016\/0167-6377(94)90079-5_BIB7","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","article-title":"Minimizing waiting time variance in the single machine problem","volume":"23","author":"Eilon","year":"1977","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangian relaxation in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Prog. Study."},{"key":"10.1016\/0167-6377(94)90079-5_BIB9","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1057\/jors.1990.104","article-title":"Minimizing the flow-time variance in single-machine systems","volume":"41","author":"Gupta","year":"1990","journal-title":"J. Opl. Res. Soc."},{"key":"10.1016\/0167-6377(94)90079-5_BIB10","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/0167-6377(91)90024-J","article-title":"Proof of a conjecture of schrage about the completion time variance problem","volume":"10","author":"Hall","year":"1991","journal-title":"Opns. Res. Lett."},{"key":"10.1016\/0167-6377(94)90079-5_BIB11","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Opns. Res."},{"key":"10.1016\/0167-6377(94)90079-5_BIB12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Prog."},{"key":"10.1016\/0167-6377(94)90079-5_BIB13","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","article-title":"Minimizing variation of flow time in single machine systems","volume":"27","author":"Kanet","year":"1981","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB14","series-title":"Completion time variance minimization on single machine is difficult","author":"Kubiak","year":"1992"},{"key":"10.1016\/0167-6377(94)90079-5_BIB15","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimization in single machine sequencing problem","volume":"18","author":"Merten","year":"1972","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Motzkin","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/0167-6377(94)90079-5_BIB17","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","article-title":"Minimizing the time-in-system variance for linear jobset","volume":"21","author":"Schrage","year":"1975","journal-title":"Mgmt. Sci."},{"key":"10.1016\/0167-6377(94)90079-5_BIB18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.35.1.111","article-title":"Deterministic and random single machine sequencing with variance minimization","volume":"35","author":"Vani","year":"1987","journal-title":"Opns. Res."},{"key":"10.1016\/0167-6377(94)90079-5_BIB19","article-title":"Minimizing the single-machine completion time variance","author":"Ventura","year":"1993"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900795?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900795?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:33Z","timestamp":1552902753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0167637794900795"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90079-5","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}