{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:43:16Z","timestamp":1772775796420,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1016\/s0377-2217(00)00170-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:50Z","timestamp":1027634690000},"page":"643-665","source":"Crossref","is-referenced-by-count":33,"title":["Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date"],"prefix":"10.1016","volume":"132","author":[{"given":"K.","family":"Gowrishankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandrasekharan","family":"Rajendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00170-3_BIB1","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1287\/mnsc.33.7.894","article-title":"Minimising mean squared deviation of completion times about a common due date","volume":"33","author":"Bagchi","year":"1987","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1057\/jors.1966.25","article-title":"Some applications of the branch and bound algorithm to the machine scheduling problem","volume":"17","author":"Brown","year":"1966","journal-title":"Operational Research Quarterly"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB3","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch and bound algorithm to minimize total tardiness with different release dates","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB5","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(00)00170-3_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0305-0548(95)00008-A","article-title":"A branch and bound algorithm to minimize mean absolute lateness on a single processor","volume":"23","author":"Fry","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0377-2217(93)90240-N","article-title":"Minimising flow time variance in a single machine system using genetic algorithm","volume":"70","author":"Gupta","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB8","first-page":"231","article-title":"Scheduling about a common due date with earliness and tardiness penalties","author":"Ghosh","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB9","doi-asserted-by":"crossref","first-page":"1712","DOI":"10.1287\/mnsc.40.12.1712","article-title":"Single machine scheduling with due dates to minimize the weighted number of tardy jobs","volume":"40","author":"Harris","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch and bound technique to some flow shop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB11","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","article-title":"Minimising variance of flow time in single machine system","volume":"27","author":"Kanet","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(93)90019-D","article-title":"Completion time variance minimisation on a single machine is difficult","volume":"14","author":"Kubiak","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB13","doi-asserted-by":"crossref","unstructured":"Lomnicki, L., 1965. A branch and bound algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quarterly 16","DOI":"10.2307\/3006687"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB14","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/mnsc.18.9.518","article-title":"Variance minimisation single machine sequencing problems","volume":"18","author":"Merten","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB15","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1287\/opre.15.3.473","article-title":"Flow shop scheduling with the branch and bound method","volume":"15","author":"McMahon","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine n-job flow shop scheduling problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB17","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","article-title":"Minimising late jobs in the general one machine scheduling problem","volume":"81","author":"P\u00e9r\u00e8s","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB18","first-page":"144","article-title":"Scheduling problems with non-regular penalty functions \u2013 a review","volume":"25","author":"Raghavachari","year":"1988","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB19","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two-stage flow shop scheduling problem with bi-criteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB20","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1002\/1520-6750(198910)36:5<663::AID-NAV3220360510>3.0.CO;2-X","article-title":"Single machine scheduling to minimise absolute deviation of completion times about a common due date","volume":"36","author":"Szwarc","year":"1989","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB21","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0305-0548(96)00037-8","article-title":"Single machine scheduling to minimize weighted earliness subject to maximum tardiness","volume":"24","author":"Tsiuschuang","year":"1997","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00170-3_BIB22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.35.1.111","article-title":"Deterministic and random single machine sequencing with variance minimisation","volume":"35","author":"Vani","year":"1987","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001703?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001703?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T19:30:11Z","timestamp":1580239811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0377221700001703"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00170-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}