{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T15:38:28Z","timestamp":1770997108562,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00016-9","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T14:52:27Z","timestamp":1046789547000},"page":"593-606","source":"Crossref","is-referenced-by-count":118,"title":["Improved genetic algorithm for the permutation flowshop scheduling problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Srikanth K.","family":"Iyer","sequence":"first","affiliation":[]},{"given":"Barkha","family":"Saxena","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00016-9_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research and Logistics Quarterly"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB2","series-title":"Adaption in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB3","series-title":"GAs in search, optimization and machine learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB4","unstructured":"Davis L, editor. Handbook of genetic algorithm. New York: Van Nostrand Reinhold, 1991."},{"key":"10.1016\/S0305-0548(03)00016-9_BIB5","unstructured":"Jog P et al. The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem. Proceedings of the Third IGCA, San Mateo 1989, p. 110\u20135."},{"key":"10.1016\/S0305-0548(03)00016-9_BIB6","unstructured":"Starkweather T et al. A comparison of genetic sequencing operators. Proceedings of Fourth IGCA, 1991, p. 69\u201376."},{"key":"10.1016\/S0305-0548(03)00016-9_BIB7","series-title":"Parallel problem solving for nature","first-page":"109","article-title":"Genetic local search algorithms for the travelling salesman problem","author":"Ulder","year":"1991"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB8","doi-asserted-by":"crossref","unstructured":"Fox BR, McMahon MB. In: Rawlins GJE, editor. Genetic operations for sequencing problems, foundations of genetic algorithms. San Mateo: Morgan Kaufmann Publishers; 1991, p. 284\u2013300.","DOI":"10.1016\/B978-0-08-050684-5.50021-5"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0165-0114(94)90210-0","article-title":"Genetic algorithms and neighbourhood search algorithms for fuzzy flowshop scheduling problems","volume":"67","author":"Ischibuchi","year":"1994","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB10","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","article-title":"Simulated annealing for permutation flow-shop scheduling","volume":"17","author":"Osman","year":"1989","journal-title":"OMEGA"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","article-title":"The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem","volume":"17","author":"Ogbu","year":"1989","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"Genetic algorithm for flowshop sequencing","volume":"15","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristics methods for flow-shop sequencing problem","volume":"47","author":"Taillard","year":"1991","journal-title":"European Journal of Operations Research"},{"issue":"4","key":"10.1016\/S0305-0548(03)00016-9_BIB14","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","article-title":"Genetic algorithm for flowshop scheduling problems","volume":"30","author":"Murata","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB15","series-title":"Multi-objective scheduling by genetic algorithms","author":"Bagchi","year":"1999"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB16","series-title":"Scheduling theory, algorithms and systems","author":"Pinedo","year":"1995"},{"issue":"6","key":"10.1016\/S0305-0548(03)00016-9_BIB17","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1111\/j.1475-3995.2000.tb00222.x","article-title":"How to keep good schemata using crossover operators for the permutation problems","volume":"7","author":"Djerid","year":"2000","journal-title":"International Transactions in Operations Research"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB18","unstructured":"Portmann MC, Vignier A. Performance study on crossover operators keeping goos schemata for some scheduling problems. 2002, preprint."},{"key":"10.1016\/S0305-0548(03)00016-9_BIB19","unstructured":"Davis L. Job-shop scheduling with genetic algorithms. Proceedings of the First International Conference on Genetic Algorithms and their Applications. Hillsdale: Lawrence Erlbaum. p. 136\u201340."},{"key":"10.1016\/S0305-0548(03)00016-9_BIB20","doi-asserted-by":"crossref","unstructured":"Falkenauer E, Bouffouix S. A genetic algorithm for job shop. Proceedings of the IEEE International Conference on Robotics and Automation, vol. 1. Sacramento. p. 824\u20139.","DOI":"10.1109\/ROBOT.1991.131689"},{"issue":"4\u20135","key":"10.1016\/S0305-0548(03)00016-9_BIB21","first-page":"409","article-title":"Les Algorithms Gntiques et leur application aux problems d'ordonnancement","volume":"29","author":"Caux","year":"1995","journal-title":"Rairo-APII"},{"issue":"1\/2","key":"10.1016\/S0305-0548(03)00016-9_BIB22","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/12460125.1996.10511679","article-title":"Performance analysis of permutation crossover genetic operators","volume":"4","author":"Djerid","year":"1996","journal-title":"Journal of Decision Systems"},{"issue":"3","key":"10.1016\/S0305-0548(03)00016-9_BIB23","first-page":"46","article-title":"Calibration of GA parameters","volume":"26","author":"Bagchi","year":"1996","journal-title":"Computer Science and Informatics"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB24","series-title":"Introduction to sequencing and scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0305-0548(03)00016-9_BIB25","series-title":"Introduction to algorithms","author":"Corman","year":"1990"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000169?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000169?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T19:19:23Z","timestamp":1584472763000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000169"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00016-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}