{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:18:27Z","timestamp":1778563107066,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00021-7","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T19:05:42Z","timestamp":1038855942000},"page":"505-526","source":"Crossref","is-referenced-by-count":41,"title":["Two-machine flowshop scheduling with a secondary criterion"],"prefix":"10.1016","volume":"30","author":[{"given":"Vincent","family":"T'kindt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jatinder N.D.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Billaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00021-7_BIB1","doi-asserted-by":"crossref","unstructured":"T'kindt V, Billaut J-C. Some Guidelines to solve multicriteria scheduling problems. IEEE Conference on Systems, Man and Cybernetics (SMC\u201999), Tokyo, Japan.","DOI":"10.1109\/ICSMC.1999.816596"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1051\/ro:2001109","article-title":"Multicriteria scheduling problems: a survey","volume":"35","author":"T'kindt","year":"2001","journal-title":"RAIRO\/Operations Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB3","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two stage flowshop scheduling problem with bicriteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB4","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","article-title":"Genetic algorithms for the two-stage bicriteria flowshop problem","volume":"95","author":"Neppalli","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/095372899233217","article-title":"Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning and Control: An International Journal"},{"issue":"3","key":"10.1016\/S0305-0548(02)00021-7_BIB6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0925-5273(00)00039-6","article-title":"Minimizing total flow time in a two-machine flowshop problem with minimum makespan","volume":"69","author":"Gupta","year":"2001","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"10.1016\/S0305-0548(02)00021-7_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0305-0548(00)00061-7","article-title":"Local search heuristics for two-stage flow shop problems with secondary criterion","volume":"29","author":"Gupta","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB8","unstructured":"Chen CL, Vempati VS. Multicriteria flow shop scheduling: minimizing total flow time and maximum completion time. Working paper, Department of Industrial Engineering, Mississippi State University, 1992."},{"key":"10.1016\/S0305-0548(02)00021-7_BIB9","unstructured":"T'kindt V, Richard P, Proust C, Billaut J-C. Resolution of a 2-machine bicriteria flowshop scheduling problem. International Conference on Methods and Applications of Multicriteria Decision Making (MAMDM\u201997), Mons, Belgium, May 1997. p. 139\u201344."},{"key":"10.1016\/S0305-0548(02)00021-7_BIB10","series-title":"Handbook of combinatorial optimization","first-page":"21","article-title":"A review of machine scheduling: complexity, algorithms and applications","author":"Chen","year":"1998"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"The complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/palgrave.jors.0400410","article-title":"Alternative formulations of a flowshop scheduling problem","volume":"40","author":"Wilson","year":"1989","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/jors.1995.102","article-title":"A branch-and-bound approach for a two-machine flowshop scheduling problem","volume":"46","author":"Nagar","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB15","unstructured":"Della Croce F, Ghirardi M, Tadei R. An improved branch and bound algorithm for the two-machine total completion time flowshop problem. European Journal of Operational Research, in press."},{"key":"10.1016\/S0305-0548(02)00021-7_BIB16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03500931","article-title":"Minimizing the sum of the job completion times in the two-machine flow shop by lagrangean relaxation","volume":"26","author":"van de Velde","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB17","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","article-title":"The two machine total completion time flowshop problem","volume":"90","author":"Della Croce","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00021-7_BIB18","first-page":"35","article-title":"Two-machine flowshop scheduling to minimize mean flow time","volume":"30","author":"Cadambi","year":"1993","journal-title":"OpSearch"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T18:50:23Z","timestamp":1578423023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0305054802000217"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00021-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}