{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:22:47Z","timestamp":1783182167796,"version":"3.54.6"},"reference-count":17,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1016\/s0305-0548(97)00032-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1119-1128","source":"Crossref","is-referenced-by-count":12,"title":["Pseudopolynomial algorithms for CTV minimization in single machine scheduling"],"prefix":"10.1016","volume":"24","author":[{"given":"D.K.","family":"Manna","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Rajendra Prasad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00032-4_BIB1","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\/S0305-0548(97)00032-4_BIB2","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\/S0305-0548(97)00032-4_BIB3","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\/S0305-0548(97)00032-4_BIB4","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\/S0305-0548(97)00032-4_BIB5","first-page":"109","article-title":"On the complexity of completion time variance minimization problem","volume":"10","author":"Cheng","year":"1993","journal-title":"Asia Pacific Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB6","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1287\/mnsc.23.6.567","article-title":"Minimizing waiting time variance in single machine problem","volume":"23","author":"Eilon","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB7","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","article-title":"Minimizing variance of flowtime in single machine systems","volume":"27","author":"Kanet","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB8","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":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB9","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1057\/jors.1990.104","article-title":"Minimizing the flowtime variance in single machine systems","volume":"41","author":"Gupta","year":"1990","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0377-2217(93)90240-N","article-title":"Minimizing the flowtime variance in a single machine system using genetic algorithms","volume":"70","author":"Gupta","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0305-0548(93)90066-R","article-title":"A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions","volume":"20","author":"Mittenthal","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB12","article-title":"Scheduling on single machine to minimize variance of completion times","author":"Manna","year":"1993"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB13","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimizing squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB14","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 and Operations Research"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB15","article-title":"Minimization of completion time variance using a dominance criterion and a lower bound","author":"Manna","year":"1994"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB16","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0305-0548(97)00032-4_BIB17","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":"1993","journal-title":"Operations Research Letters"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T11:22:54Z","timestamp":1556277774000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":17,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["S0305054897000324"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00032-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}