{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:33:18Z","timestamp":1769164398677,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10589-008-9206-5","type":"journal-article","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T16:20:56Z","timestamp":1221841256000},"page":"61-76","source":"Crossref","is-referenced-by-count":27,"title":["Solving job shop scheduling problems utilizing the\u00a0properties of backbone and \u201cbig valley\u201d"],"prefix":"10.1007","volume":"47","author":[{"given":"Panos M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"Oleg V.","family":"Shylo","sequence":"additional","affiliation":[]},{"given":"Alkis","family":"Vazacopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"9206_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R. Aiex","year":"2003","unstructured":"Aiex, R., Binato, S., Resende, M.: Parallel grasp with path-relinking for job shop scheduling. Parallel Comput. 29, 393\u2013430 (2003)","journal-title":"Parallel Comput."},{"key":"9206_CR2","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. Manag. Sci. 44, 262\u2013275 (1998)","journal-title":"Manag. Sci."},{"key":"9206_CR3","first-page":"59","volume-title":"Essays and Surveys on Metaheuristics","author":"S. Binato","year":"2001","unstructured":"Binato, S., Hery, W., Loewenstern, D., Resende, M.: A GRASP for job shop scheduling. In: Essays and Surveys on Metaheuristics, pp. 59\u201379. Kluwer Academic, Dordrecht (2001)"},{"issue":"1","key":"9206_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","volume":"93","author":"J. Blazewicz","year":"1996","unstructured":"Blazewicz, J., Domschke, W., Pesch, E.: The job-shop scheduling problem: Conventional and new solution techniques. Eur. J. Oper. Res. 93(1), 1\u201333 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9206_CR5","unstructured":"Darwen, P.J.: Looking for the big valley in the fitness landscape of single machine scheduling with batching, precedence constraints, and sequence-dependent setup times. In: 5th Australasia-Japan Joint Workshop University of Otago, Dunedin, New Zealand, 19\u201321 November 2001"},{"key":"9206_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E. Demirkol","year":"1997","unstructured":"Demirkol, E., Mehta, S., Uzsloy, R.: Benchmarks for job shop scheduling problems. Eur. J. Oper. Res. 109, 137\u2013141 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9206_CR7","first-page":"67","volume":"35","author":"J. Grabowski","year":"1988","unstructured":"Grabowski, J., Nowicki, E., Smutnicki, C.: Block algorithm for scheduling of operations in job-shop system. Prz. Stat. 35, 67\u201380 (1988) (in Polish)","journal-title":"Prz. Stat."},{"key":"9206_CR8","unstructured":"Internet: Home page Eric Taillard http:\/\/www.eivd.ch\/ina\/collaborateurs\/etd\/default.htm (2008). Accessed 22 January 2008"},{"key":"9206_CR9","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.: Deterministic job shop scheduling: Past, present and future. Eur. J. Oper. Res. 113, 390\u2013434 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9206_CR10","unstructured":"Internet: Job Shop Scheduling webpage http:\/\/plaza.ufl.edu\/shylo\/jobshopinfo.html (2008). Accessed 22 January 2008"},{"issue":"4598","key":"9206_CR11","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9206_CR12","volume-title":"Recent Developments in Deterministic Sequencing and Scheduling","author":"E.L. Lawler","year":"1982","unstructured":"Lawler, E.L., Lenstra, J.-K., Rinnooy Kan, A.: Recent Developments in Deterministic Sequencing and Scheduling, pp. 35\u201373. Reidel, Dordrecht (1982)"},{"key":"9206_CR13","first-page":"569","volume-title":"Handbook of Applied Optimization","author":"C.-Y. Lee","year":"2002","unstructured":"Lee, C.-Y., Pinedo, M.: Optimization and heuristic scheduling. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 569\u2013584. Oxford University Press, London (2002)"},{"key":"9206_CR14","volume-title":"Handbook of Metaheuristics","author":"H. Lourenco","year":"2003","unstructured":"Lourenco, H., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer Academic, Dordrecht (2003)"},{"issue":"6","key":"9206_CR15","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 tabu search algorithm for the job-shop problem. Manag. Sci. 42(6), 797\u2013813 (1996)","journal-title":"Manag. Sci."},{"issue":"2","key":"9206_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An advanced tabu search algorithm for the job shop problem. J. Sched. 8(2), 145\u2013159 (2005)","journal-title":"J. Sched."},{"key":"9206_CR17","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/0-387-23667-8_7","volume-title":"Some new ideas in TS for job shop scheduling","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: Some new ideas in TS for job shop scheduling. In: Operations Research\/Computer Science Interfaces Series, vol. 30, pp. 165\u2013190. Springer, Berlin (2005). Part II"},{"issue":"2","key":"9206_CR18","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.ejor.2004.08.021","volume":"169","author":"E. Nowicki","year":"2006","unstructured":"Nowicki, E., Smutnicki, C.: Some aspects of scatter search in the flow-shop problem. EJOR 169(2), 654\u2013666 (2006)","journal-title":"EJOR"},{"issue":"4","key":"9206_CR19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10287-006-0023-y","volume":"3","author":"P. Pardalos","year":"2006","unstructured":"Pardalos, P., Shylo, O.: An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Comput. Manag. Sci. 3(4), 331\u2013348 (2006)","journal-title":"Comput. Manag. Sci."},{"key":"9206_CR20","unstructured":"Roy, B., Sussman, B.: Les probl\u00e8m d\u2019ordonnancement avec contraintes disjonctives. Note DS9 bis, SEMA, Paris (1964) (in French)"},{"key":"9206_CR21","first-page":"74","volume":"1","author":"V. Shylo","year":"1999","unstructured":"Shylo, V.: A global equilibrium search method. Kybern. Syst. Anal. 1, 74\u201380 (1999) (in Russian)","journal-title":"Kybern. Syst. Anal."},{"key":"9206_CR22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1613\/jair.2013","volume":"26","author":"J. Streeter","year":"2006","unstructured":"Streeter, J., Smith, S.: How the landscape of random job shop scheduling instances depends on the ratio of jobs to machines. J. Artif. Intell. Res. 26, 247\u2013287 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9206_CR23","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.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9206_CR24","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.: Job shop scheduling by simulated annealing. Oper. Res. 40, 113\u2013125 (1992)","journal-title":"Oper. Res."},{"key":"9206_CR25","unstructured":"Watson, J., Howe, A., Whitley, L.: An analysis of iterated local search for job-shop scheduling. In: Fifth Metaheuristics International Conference (MIC 2003), September 2003"},{"issue":"2","key":"9206_CR26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0004-3702(02)00363-6","volume":"143","author":"J.-P. Watson","year":"2003","unstructured":"Watson, J.-P., Beck, J., Howe, A., Whitley, L.: Problem difficulty for tabu search in job-shop scheduling. Artif. Intell. 143(2), 189\u2013217 (2003)","journal-title":"Artif. Intell."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9206-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9206-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9206-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:35Z","timestamp":1559302595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9206-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9206"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9206-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,20]]}}}