{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:34:50Z","timestamp":1774485290084,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":[[2000,7]]},"DOI":"10.1016\/s0377-2217(99)00168-x","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"28-42","source":"Crossref","is-referenced-by-count":158,"title":["A hybrid genetic algorithm for the open shop scheduling problem"],"prefix":"10.1016","volume":"124","author":[{"given":"Ching-Fang","family":"Liaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00168-X_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.3220360305","article-title":"Open shop scheduling problems with dominated machines","volume":"36","author":"Adiri","year":"1989","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB3","first-page":"8","article-title":"A Polynomial-time algorithm of approximate solution of a scheduling problem","volume":"28","author":"Aksjonov","year":"1988","journal-title":"Upravlyaemye Sistemy"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB4","first-page":"283","article-title":"Heuristic approaches for the minimum makespan open shop problem","volume":"5","author":"Alcaide","year":"1997","journal-title":"Journal of the Spanish Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1958","journal-title":"Quarterly Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02243845","article-title":"Constructive heuristic algorithms for the open shop problem","volume":"51","author":"Br\u00e4sel","year":"1993","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","article-title":"A branch and bound algorithm for the open-shop problem","volume":"76","author":"Brucker","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/ijoc.5.3.321","article-title":"Approximation algorithms for three-machine open shop scheduling","volume":"5","author":"Chen","year":"1993","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB10","doi-asserted-by":"crossref","unstructured":"E. Falkenauer, S. Bouffouix, A genetic algorithm for job shop, in: Proceedings of the IEEE International Conference on Robotics and Automation, 1991, pp. 824\u2013829","DOI":"10.1109\/ROBOT.1991.131689"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB11","unstructured":"H.L. Fang, P. Ross, D. Corne, A promising hybrid GA\/heuristic approach for open-shop scheduling problems, in: A. Cohn (Ed.), Proceedings of ECAI 94, 11th European Conference on Artificial Intelligence, 1994, pp. 590\u2013594"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB12","doi-asserted-by":"crossref","unstructured":"M. Gen, R. Cheng, Genetic Algorithms & Engineering Design, Wiley, New York, 1997","DOI":"10.1002\/9780470172254"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB13","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","article-title":"Algorithms for solving production scheduling problems","volume":"8","author":"Giffler","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future paths for integer programming and links to artificial intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB15","doi-asserted-by":"crossref","unstructured":"F. Glover, M. Laguna, Tabu Search, Kluwer Academic Publishers, Dordrecht, 1997","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB16","unstructured":"D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Welsey, Reading, MA, 1989"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB17","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Open shop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB19","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/S0377-2217(97)00332-9","article-title":"Classical and new heuristics for the open-shop problem: a computational evaluation","volume":"107","author":"Gueret","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB20","unstructured":"J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB21","unstructured":"P. Jog, J.Y. Suh, D.V. Gucht, The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem, in: Proceedings of the Third International Conference on Genetic Algorithms, 1989"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB22","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(97)00366-4","article-title":"An iterative improvement approach for the nonpreemptive open shop scheduling problem","volume":"111","author":"Liaw","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","article-title":"A tabu search algorithm for the open shop scheduling problem","volume":"26","author":"Liaw","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB24","doi-asserted-by":"crossref","unstructured":"C.F. Liaw, Applying simulated annealing to the open shop scheduling problem, Working paper, Department of Industrial Engineering and Management, Chaoyang University of Technology, Taiwan, 1999","DOI":"10.1080\/07408179908969848"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB25","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1109\/21.260665","article-title":"An evaluation of local improvement operators for genetic algorithms","volume":"23","author":"Miller","year":"1993","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB26","doi-asserted-by":"crossref","unstructured":"H. Muhlenbein, Eovlution in time and space-the parallel genetic algorithm, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, Morgan Kaufmann, CA, 1991","DOI":"10.1016\/B978-0-08-050684-5.50023-9"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB27","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast tabu search algorithm for the job shop problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB28","unstructured":"M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB29","doi-asserted-by":"crossref","unstructured":"P. Prinetto, M. Rebaudengo, M. Reorda, Hybrid genetic algorithms for the travelling salesman problem, in: Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, 1993","DOI":"10.1007\/978-3-7091-7533-0_81"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB30","unstructured":"C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB31","first-page":"303","article-title":"Machine aggregation heuristics in shop-scheduling","volume":"45","author":"R\u00f6ck","year":"1983","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB32","unstructured":"B. Roy, B. Sussmann, Les problemes d'ordonnancement avec contraintes disjonctives, SEMA, Note D.S. No. 9, 1964"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","article-title":"On some geometric methods in scheduling theory: A survey","volume":"55","author":"Sevast'janov","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/00207729708929359","article-title":"A genetic algorithm applied to a classic job-shop scheduling problem","volume":"28","author":"Shi","year":"1997","journal-title":"International Journal of Systems Science"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB35","unstructured":"D.B. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for the shop scheduling problems, in: Proceedings of the Second ACM-SIAM Symposium on Discrete Algorithms, 1991, pp. 148-157"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB36","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel taboo search techniques for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB37","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB38","doi-asserted-by":"crossref","unstructured":"V.S. Tanaev, Y.N. Sotskov, V.A. Strusevich, Scheduling Theory: Multi-Stage Systems, Kluwer Academic Publishers, Dordrecht, 1994","DOI":"10.1007\/978-94-011-1192-8"},{"key":"10.1016\/S0377-2217(99)00168-X_BIB39","doi-asserted-by":"crossref","unstructured":"N.L.J. Ulder, E.H.L. Aarts, H.J. Bandelt, P.J.M. Laarhoven, E. Pesch, Genetic local search algorithms for the travelling salesman problem, in: H.P. Schwefel, R. Manner (Eds.), Parallel Problem-Solving from Nature, Springer, Berlin, 1991","DOI":"10.1007\/BFb0029740"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900168X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179900168X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T22:12:37Z","timestamp":1580854357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179900168X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S037722179900168X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00168-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}