{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T01:07:29Z","timestamp":1781744849921,"version":"3.54.5"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"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":[[2004,9]]},"DOI":"10.1016\/s0377-2217(03)00192-9","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T19:44:52Z","timestamp":1059680692000},"page":"286-295","source":"Crossref","is-referenced-by-count":36,"title":["Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan"],"prefix":"10.1016","volume":"157","author":[{"given":"Berkin","family":"Tokta\u015f","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meral","family":"Azizo\u011flu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suna Kondakc\u0131","family":"K\u00f6ksalan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00192-9_BIB1","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1002\/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H","article-title":"Multi-objective flow-shop scheduling","volume":"37","author":"Daniels","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB2","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":"1998","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB3","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/0305-0483(89)90063-7","article-title":"A framework for single machine multi objective sequencing research","volume":"17","author":"Fry","year":"1989","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB4","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 flow shop problem with minimum makespan","volume":"69","author":"Gupta","year":"2001","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB5","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1287\/opre.39.5.836","article-title":"Earliness\u2013tardiness scheduling problems I: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB6","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.39.5.847","article-title":"Earliness\u2013tardiness scheduling problems II: Weighted deviation of completion times about a common due date","volume":"39","author":"Hall","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.21.1.100","article-title":"Minimizing maximum promptness and maximum lateness on a single-machine","volume":"21","author":"Hoogeveen","year":"1996","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB8","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","article-title":"A multi-objective genetic local search algorithm and its application to flow shop scheduling","volume":"28","author":"Ishibuchi","year":"1998","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB9","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\/S0377-2217(03)00192-9_BIB10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/0377-2217(82)90182-5","article-title":"An algorithm for the multi objective integer linear programming problem","volume":"9","author":"Klein","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB11","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1080\/07408179808966450","article-title":"Minimizing flow time and maximum earliness on a single machine","volume":"30","author":"K\u00f6ksalan","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/9789814354363_0013","article-title":"Complexity of single machine hierarchical scheduling: A survey","volume":"19","author":"Lee","year":"1993","journal-title":"Complexity in Numerical Optimization"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB13","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/jors.1995.102","article-title":"A branch-and-bound approach for a two-machine flow shop scheduling problem","volume":"46","author":"Nagar","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB14","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","article-title":"Genetic algorithms for the two-stage bicriteria flow shop problem","volume":"95","author":"Neppalli","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB15","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1057\/jors.1992.126","article-title":"Two-stage flow shop scheduling problem with bicriteria","volume":"43","author":"Rajendran","year":"1992","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB16","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(03)00192-9_BIB17","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/S0377-2217(97)00338-X","article-title":"A bicriteria two-machine permutation flow shop problem","volume":"107","author":"Sivrikaya-Serifoglu","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(99)00447-6","article-title":"Scheduling in a two machine flowshop with batch processing machines for earliness\/tardiness measure under a common due date","volume":"131","author":"Sung","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB19","doi-asserted-by":"crossref","unstructured":"T'kindt, V., Billaut, J.C., 1999. Some guidelines to solve multicriteria scheduling problems. In: Proceedings of IEEE Conference on Systems, Man and Cybernetics, VI-463, VI-468","DOI":"10.1109\/ICSMC.1999.816596"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB20","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0377-2217(80)90038-7","article-title":"Solving a bicriterion scheduling problem","volume":"4","author":"Van Wassenhove","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB21","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1016\/S0305-0548(01)00032-6","article-title":"Minimizing the mean weighted absolute deviation from due dates in lot streaming flowshop scheduling","volume":"29","author":"Yoon","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(03)00192-9_BIB22","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1080\/00207549508930220","article-title":"A knowledgeable simulated annealing scheme for the early\/tardy flow shop scheduling problem","volume":"33","author":"Zegordi","year":"1995","journal-title":"International Journal of Production Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703001929?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703001929?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:54:46Z","timestamp":1552794886000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703001929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0377221703001929"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00192-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}