{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:04:01Z","timestamp":1777597441031,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00211-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:12:54Z","timestamp":1027577574000},"page":"303-309","source":"Crossref","is-referenced-by-count":18,"title":["Fast fully polynomial approximation schemes for minimizing completion time variance"],"prefix":"10.1016","volume":"137","author":[{"given":"Wieslaw","family":"Kubiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinliang","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00211-9_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":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","article-title":"Minimising waiting time variance in the single machine problem","volume":"23","author":"Eilon","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB3","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":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB4","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":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB5","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB6","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 Science"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB7","unstructured":"M.Y. Kovalyov, W. Kubiak, Fully polynomial approximation schemes for decomposable partition problems, Working paper 98-16, Faculty of Business Administration, Memorial University of Newfoundland, 1998"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB8","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1287\/opre.47.5.757","article-title":"A fully polynomial approximation scheme for weighted earliness\u2013tardiness problem","volume":"47","author":"Kovalyov","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance minimization on a single machine is difficult","volume":"14","author":"Kubiak","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00211-9_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 Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00211-9_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 Science"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB12","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB13","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 Science"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/ijoc.11.2.211","article-title":"An approximation scheme for minimizing agreeably weighted variance on a single machine","volume":"11","author":"Woeginger","year":"1999","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00211-9_BIB15","unstructured":"G.J. Woeginger, When does a dynamic programming formulation guarantee the existence of an FPTAS? Report Woe-27, April 1998, TU Graz, Austria, 1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:21:39Z","timestamp":1556850099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002119"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00211-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}