{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T19:59:48Z","timestamp":1771012788966,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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,10]]},"DOI":"10.1016\/s0377-2217(02)00265-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"250-257","source":"Crossref","is-referenced-by-count":137,"title":["An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem"],"prefix":"10.1016","volume":"142","author":[{"given":"Vincent","family":"T'kindt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Monmarch\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Tercinet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"La\u00fcgt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00265-5_BIB1","unstructured":"C.-L. Chen, R.L. Bulfin, Complexity of multiple machines, multicriteria scheduling problems, in: Third Industrial Engineering Research Conference (IERC'94), Atlanta (USA), 1994, pp. 662 \u2013665"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB2","series-title":"First European Conference on Artificial Life","first-page":"134","article-title":"Distributed optimization by ants colonies","author":"Colorni","year":"1991"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB3","first-page":"39","article-title":"Ant system for job-shop scheduling","volume":"34","author":"Colorni","year":"1994","journal-title":"Belgian Journal of Operations Research Statistics and Computer Science (JORBEL)"},{"issue":"2","key":"10.1016\/S0377-2217(02)00265-5_BIB4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0377-2217(01)00374-5","article-title":"An improved branch and bound algorithm for the two-machine total completion time flow shop problem","volume":"139","author":"DellaCroce","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB5","unstructured":"F. Della Croce, M. Ghirardi, R. Tadei, Recovering Beam Search: A hybrid heuristic method for combinatorial optimization problems. Submitted to Operations Research, 2002"},{"issue":"1","key":"10.1016\/S0377-2217(02)00265-5_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0305-0483(88)90008-4","article-title":"Bicriterion static scheduling research for a single machine","volume":"16","author":"Dileepan","year":"1988","journal-title":"Omega"},{"issue":"3","key":"10.1016\/S0377-2217(02)00265-5_BIB7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","article-title":"Ant algorithms for discrete optimization","volume":"5","author":"Dorigo","year":"1999","journal-title":"Artificial Life"},{"issue":"6","key":"10.1016\/S0377-2217(02)00265-5_BIB8","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/0305-0483(89)90063-7","article-title":"A framework for single machine multiple objective sequencing research","volume":"17","author":"Fry","year":"1989","journal-title":"Omega"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/3010565","article-title":"Ants colonies for the qap","volume":"5","author":"Gambardella","year":"1999","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/S0377-2217(02)00265-5_BIB10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0305-0548(00)00061-7","article-title":"Local search heuristic for the two-stage flowshop problems with secondary criterion","volume":"29","author":"Gupta","year":"2002","journal-title":"Computers and Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00265-5_BIB11","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":"3","key":"10.1016\/S0377-2217(02)00265-5_BIB12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1080\/095372899233217","article-title":"Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion","volume":"10","author":"Gupta","year":"1999","journal-title":"Production Planning and Control"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB13","unstructured":"J.N.D. Gupta, F. Werner, On the solution of 2-machine flow and open shop scheduling problems with secondary criteria, in: 15th ISPE\/IEE International Conference on CAD\/CAM, Robotics, and Factories of the Future, Aguas de Lindoia (Brasil), 1999, pp. MW4.1-MW4.6"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB14","unstructured":"J.A. Hoogeveen, Single-Machine Bicriteria Scheduling, Ph.D. Thesis, CWI, Amsterdam, 1992"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three stage production schedules with set-up time included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB16","unstructured":"D. La\u00fcgt, F. Tercinet, N. Monmarch\u00e9, V. T'kindt, Une heuristique bas\u00e9e sur les colonies de fourmis pour r\u00e9soudre un probl\u00e8me d'ordonnancement bicrit\u00e8re, Research report 231, E3i\/Universit\u00e9 de Tours (France), in French, 2000"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","article-title":"Multiple and bicriteria scheduling: A literature survey","volume":"81","author":"Nagar","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB18","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\/S0377-2217(02)00265-5_BIB19","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\/S0377-2217(02)00265-5_BIB20","unstructured":"N.A. Rahman, A course in theoretical statistics, Griffin (London), 1968"},{"issue":"9","key":"10.1016\/S0377-2217(02)00265-5_BIB21","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 the Operational Research Society"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB22","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0377-2217(98)00009-5","article-title":"A bicriteria approach to the two-machine flow shop scheduling problem","volume":"113","author":"Sayin","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB23","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/S0377-2217(97)00338-X","article-title":"A bicriteria two-machine permutation flowshop problem","volume":"107","author":"Serifoglu","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB24","series-title":"Proceedings of EUFIT'98, Aachen (Germany)","first-page":"1560","article-title":"An ant approach to the flow shop problem","author":"St\u00fctzle","year":"1998"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB25","doi-asserted-by":"crossref","unstructured":"V. T'kindt, J.-C. Billaut, Multicriteria Scheduling: Theory, Models and Algorithms, Springer, forthcoming (2002)","DOI":"10.1007\/978-3-662-04986-0"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB26","doi-asserted-by":"crossref","unstructured":"V. T'kindt, J.N.D. Gupta, J.-C. Billaut, Two-machine flowshop scheduling with a secondary criterion, Computers and Operations Research, forthcoming (2002)","DOI":"10.1016\/S0305-0548(02)00021-7"},{"key":"10.1016\/S0377-2217(02)00265-5_BIB27","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.1016\/S0305-0548(98)00106-3","article-title":"A new branch-and-bound approach for the n\/2\/flowshop\/\u03b1f+\u03b2cmax flowshop scheduling problem","volume":"26","author":"Yeh","year":"1999","journal-title":"Computers and Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002655?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002655?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T12:36:49Z","timestamp":1580906209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002655"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0377221702002655"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00265-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}