{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T19:51:32Z","timestamp":1719085892685},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0166-218x(98)00020-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"55-70","source":"Crossref","is-referenced-by-count":10,"title":["Multi-machine scheduling with variance minimization"],"prefix":"10.1016","volume":"84","author":[{"given":"Xiaoqiang","family":"Cai","sequence":"first","affiliation":[]},{"given":"T.C.E.","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00020-1_BIB1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/0377-2217(93)E0367-7","article-title":"Minimization of agreeably weighted variance in single machine systems","volume":"85","author":"Cai","year":"1995","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB2","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 bi-criteria extension","volume":"40","author":"De","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB3","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":"Management Sci."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(98)00020-1_BIB5","series-title":"Discrete and Combinatorial Mathematics","author":"Grimaldi","year":"1994"},{"key":"10.1016\/S0166-218X(98)00020-1_BIB6","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. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/0167-6377(91)90024-J","article-title":"Proof of the conjecture of Schrage about the completion time variance problem","volume":"10","author":"Hall","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB8","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":"Management Sci."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance on a single machine is difficult","volume":"12","author":"Kubiak","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","article-title":"New results on the completion time variance minimization","volume":"58","author":"Kubiak","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB11","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimization in single machine sequencing problems","volume":"18","author":"Merten","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB12","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1287\/mnsc.21.5.540","article-title":"Minimizing the time-in-system variance for a finite jobset","volume":"21","author":"Schrage","year":"1975","journal-title":"Management Sci."},{"key":"10.1016\/S0166-218X(98)00020-1_BIB13","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":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98000201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:23:49Z","timestamp":1555176229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98000201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0166218X98000201"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00020-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}