{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:28:28Z","timestamp":1648956508168},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/bf02973438","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T16:49:33Z","timestamp":1224002973000},"page":"776-781","source":"Crossref","is-referenced-by-count":1,"title":["Algorithm based on taboo search and shifting bottleneck for job shop scheduling"],"prefix":"10.1007","volume":"19","author":[{"given":"Wen-Qi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,11]]},"reference":[{"key":"BF02973438_CR1","volume-title":"Computer and intractability: A guide to the theory of NP-completeness","author":"M R Garey","year":"1979","unstructured":"Garey M R, Johnson D S. Computer and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman, 1979."},{"issue":"3","key":"BF02973438_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D. The shifting bottleneck procedure for job shop scheduling.Management Science, 1988, 34(3): 391\u2013401.","journal-title":"Management Science"},{"issue":"2","key":"BF02973438_CR3","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1998","unstructured":"Balas E, Vazacopoulos A. Guided local search with shifting bottleneck for job shop scheduling.Management Science, 1998, 44(2): 262\u2013275.","journal-title":"Management Science"},{"key":"BF02973438_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0377-2217(99)00158-7","volume":"120","author":"F Pezzella","year":"2000","unstructured":"Pezzella F, Merelli E. A tabu search method guided by shifting bottleneck for the job shop scheduling problem.European Journal of Operational Research, 2000, 120: 297\u2013310.","journal-title":"European Journal of Operational Research"},{"key":"BF02973438_CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J Carlier","year":"1982","unstructured":"Carlier J. The one-machine sequencing problem.European J. Operations Research, 1982, 11: 42\u201347.","journal-title":"European J. Operations Research"},{"key":"BF02973438_CR6","unstructured":"Roy B, SUSSMAN B. Les Problemes d'ordonnancement Avec Contraintes Disjonctives. Paris: Note DS No.9 bis. SEMA, 1964."},{"key":"BF02973438_CR7","volume-title":"Theory of Scheduling","author":"R N Conway","year":"1967","unstructured":"Conway R N, Maxwell W L, Miller L W. Theory of Scheduling. MA, Addison-Wesley, 1967."},{"key":"BF02973438_CR8","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E Balas","year":"1969","unstructured":"Balas E. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm.Operations Research, 1969, 17: 941\u2013957.","journal-title":"Operations Research"},{"issue":"6","key":"BF02973438_CR9","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C. A fast taboo search algorithm for the job shop problem.Management Science, 1996, 42(6): 797\u2013813.","journal-title":"Management Science"},{"key":"BF02973438_CR10","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF02023611","volume":"5","author":"F Glover","year":"1985","unstructured":"Glover F. Interactive decision software and computer graphics for architectural and space planning.Annals of Operations Research, 1985, 5: 557\u2013573.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"BF02973438_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F. Future path for integer programming and links to artificial intelligence.Computers and Operations Research, 1986, 13(5): 533\u2013549.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"BF02973438_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F. Tabu search-Part I.ORSA J. Computing, 1989, 1(3): 190\u2013206.","journal-title":"ORSA J. Computing"},{"issue":"1","key":"BF02973438_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F, McMilan C, Novick B. Tabu search-Part II.ORSA J. Computing, 1990, 2(1): 4\u201332.","journal-title":"ORSA J. Computing"},{"issue":"1","key":"BF02973438_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P J M Laarhoven Van","year":"1992","unstructured":"Van Laarhoven P J M, Aarts E H L, Lenstra J K. Job shop scheduling by simulated annealing.Operations Research, 1992, 40(1): 113\u2013125.","journal-title":"Operations Research"},{"key":"BF02973438_CR15","unstructured":"Lawrence S. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. GSIA, Carnegie-Mellon University, October 1984."},{"key":"BF02973438_CR16","volume-title":"Industrial Scheduling","author":"H Fisher","year":"1963","unstructured":"Fisher H, Thompson G L. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. Industrial Scheduling, Muth J F, Thompson G L (eds.), Englewood, Chichester, UK, Prentic-Hall, 1963."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973438.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02973438\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:31:30Z","timestamp":1558553490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02973438"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["BF02973438"],"URL":"https:\/\/doi.org\/10.1007\/bf02973438","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}