{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T20:05:05Z","timestamp":1769198705889,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,6,13]],"date-time":"2006-06-13T00:00:00Z","timestamp":1150156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMS"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10287-006-0023-y","type":"journal-article","created":{"date-parts":[[2006,6,12]],"date-time":"2006-06-12T05:10:44Z","timestamp":1150089044000},"page":"331-348","source":"Crossref","is-referenced-by-count":38,"title":["An Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques"],"prefix":"10.1007","volume":"3","author":[{"given":"Panos M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"Oleg V.","family":"Shylo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,13]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D Applegate","year":"1991","unstructured":"Applegate D, Cook W (1991) A computational study of the job-shop scheduling instance. ORSA J Comput 3:149\u2013156","journal-title":"ORSA J Comput"},{"key":"23_CR2","volume-title":"Guided local search with shifting bottleneck for job shop scheduling","author":"E Balas","year":"1995a","unstructured":"Balas E, Vazacopoulos A (1995a) Guided local search with shifting bottleneck for job shop scheduling. MSSRR 609, GSIA, Carnegie Mellon University, Pittsburgh"},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","volume":"44","author":"E Balas","year":"1995b","unstructured":"Balas E, Vazacopoulos A (1995b) Guided local search with shifting bottleneck for job shop scheduling. Manage Sci 44:262\u2013275","journal-title":"Manage Sci"},{"key":"23_CR4","first-page":"59","volume-title":"A GRASP for job shop scheduling, Essays and surveys on metaheuristics","author":"S Binato","year":"2001","unstructured":"Binato S, Hery W, Loewenstern D, Resende M (2001) A GRASP for job shop scheduling, Essays and surveys on metaheuristics. Kluwer, Dordrecht, pp 59\u201379"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkkol","year":"1997","unstructured":"Demirkkol E, Mehta S, Uzsloy R (1997) Benchmarks for job shop scheduling problems. Eur J Operat Res 109:137\u2013141","journal-title":"Eur J Operat Res"},{"key":"23_CR6","unstructured":"Grabowski J, Nowicki E, Smutnicki C (1988) Block algorithm for scheduling of operations in job-shop system (polish) Przeglad Statystyczny 35:67\u201380"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A Jain","year":"1999","unstructured":"Jain A, Meeran S (1999) Deterministic job shop scheduling: past, present and future. Eur J Operat Res 113:390\u2013434","journal-title":"Eur J Operat Res"},{"issue":"4","key":"23_CR8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1023\/A:1009617209268","volume":"6","author":"A Jain","year":"2000","unstructured":"Jain A, Rangaswamy B, Meeran S (2000) New and stronger job shop neighborshoods: a focus on the method of nowicki and smutnicki (1996). J Heurist 6(4):457\u2013480","journal-title":"J Heurist"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Lawler EL, Lenstra J-K, Rinnooy KA (1982) Recent developments in deterministic sequencing and scheduling Reidel, Dordrecht pp 35\u201373","DOI":"10.1007\/978-94-009-7801-0_3"},{"key":"23_CR10","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration Carnegie-Mellon University, Pittsburgh, Pennsylvania."},{"key":"23_CR11","first-page":"569","volume-title":"Handbook of Applied Optimization","author":"C-Y Lee","year":"2002","unstructured":"Lee C-Y, Pinedo M (2002) Optimization and heuristic scheduling. In: Pardalos PM, Resende MGC (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp 569\u2013584"},{"issue":"6","key":"23_CR12","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 (1996) A fast tabu search algorithm for the job-shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"key":"23_CR13","volume-title":"Some new tools to solve the job shop problem","author":"E Nowicki","year":"2002","unstructured":"Nowicki E, Smutnicki C (2002) Some new tools to solve the job shop problem. Technical report 60\/2002, Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland"},{"key":"23_CR14","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 (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Operat Res 120:297\u2013310","journal-title":"Eur J Operat Res"},{"key":"23_CR15","unstructured":"Roy B, Sussman B (1964) Les problemes d\u2019ordonnancement avec contraintes disjonctives. Note DS9 bis, SEMA, Paris (in French)"},{"key":"23_CR16","first-page":"74","volume":"1","author":"V Shylo","year":"1999","unstructured":"Shylo V (1999) A global equilibrium search method (Russian). Kybernetika i Systemniy Analys 1:74\u201380","journal-title":"Kybernetika i Systemniy Analys"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Operat Res 64:278\u2013285","journal-title":"Eur J Operat Res"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P Laarhoven Van","year":"1992","unstructured":"Van Laarhoven P, Aarts E, Lenstra J (1992) Job shop scheduling by simulated annealing. Operat Res 40:113\u2013125","journal-title":"Operat Res"},{"key":"23_CR19","unstructured":"Watson J, Howe A, Whitley L (2003) An analysis of iterated local search for job-shop scheduling. In: Fifth metaheuristics international Conference (MIC 2003)"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0023-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-006-0023-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-006-0023-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:46Z","timestamp":1559117566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-006-0023-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,13]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s10287-006-0023-y","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,13]]}}}