{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:52:23Z","timestamp":1725472343245},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490265"},{"type":"electronic","value":"9783540490586"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925231_42","type":"book-chapter","created":{"date-parts":[[2006,11,6]],"date-time":"2006-11-06T14:48:34Z","timestamp":1162824514000},"page":"450-460","source":"Crossref","is-referenced-by-count":1,"title":["A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Marco Antonio","family":"Cruz-Ch\u00e1vez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Frausto-Sol\u00eds","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"I","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of Flow shop and Job shop Scheduling. Mathematics of Operations Research\u00a0I(2), 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"42_CR2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J.: A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing\u00a06, 118\u2013125 (1994)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"42_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1023\/B:HEUR.0000026896.44360.f9","volume":"10","author":"M.E. Aydin","year":"2004","unstructured":"Aydin, M.E., Fogarty, T.C.: A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. Journal of Heuristics\u00a010(3), 269\u2013292 (accepted for publication, 2004)","journal-title":"Journal of Heuristics"},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","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. Oper. Res.\u00a040(1), 113\u2013125 (1992)","journal-title":"Oper. Res."},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-1-4613-1361-8_15","volume-title":"Meta-heuristics: theory and applications","author":"T. Yamada","year":"1996","unstructured":"Yamada, T., Nakano, R.: Job-shop scheduling by simulated annealing combined with deterministic local search. In: Meta-heuristics: theory and applications, pp. 237\u2013248. Kluwer academic publishers, USA (1996)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Yamada, T., Rosen, B.E., Nakano, R.: A simulated annealing approach to job shop scheduling using critical block transition operators. IEEE, Los Alamitos (1994), 0-7803-1901-X\/94","DOI":"10.1109\/ICNN.1994.375033"},{"issue":"14","key":"42_CR7","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1016\/S0305-0548(02)00128-4","volume":"30","author":"K. Steinh\u00f6fel","year":"2003","unstructured":"Steinh\u00f6fel, K., Albrecht, A., Wong, C.K.: An Experimental Analysis of Local Minima to Improve Neighborhood Search. Computers & Operations Research\u00a030(14), 2157\u20132173 (2003)","journal-title":"Computers & Operations Research"},{"key":"42_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/978-3-540-24844-6_133","volume-title":"Artificial Intelligence and Soft Computing - ICAISC 2004","author":"M.A. Cruz-Ch\u00e1vez","year":"2004","unstructured":"Cruz-Ch\u00e1vez, M.A., Frausto-Sol\u00eds, J.: Simulated Annealing with Restart to Job Shop Scheduling Problem Using Upper Bounds. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol.\u00a03070, pp. 860\u2013865. Springer, Heidelberg (2004)"},{"key":"42_CR9","unstructured":"Knust, S.: Optimal conditions and exact neighborhoods for sequencing problems, Universit\u00e4t Osnabr\u00fcck Fachbereich Mathematik\/Informatik, D-49069 Osnabruck, Germany (January 1997)"},{"issue":"4","key":"42_CR10","first-page":"334","volume":"1","author":"M.A. Cruz-Ch\u00e1vez","year":"2004","unstructured":"Cruz-Ch\u00e1vez, M.A., Frausto-Sol\u00eds, J., Ramos-Quintana, F.: The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem. International Journal of Computational Intelligence, ENFORMATIKA\u00a01(4), 334\u2013337 (2004)","journal-title":"International Journal of Computational Intelligence, ENFORMATIKA"},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/S0377-2217(01)00048-0","volume":"136","author":"S. Chanas","year":"2002","unstructured":"Chanas, S., Zielinski, P.: The Computational Complexity of the Critical Problems in a Network with Interval Activity Times. European Journal of Operational Research\u00a0136, 541\u2013550 (2002)","journal-title":"European Journal of Operational Research"},{"key":"42_CR12","unstructured":"Yildiz, H.: Simulated Annealing & Applications to Scheduling Problems, Department of Industrial Engineering, Bilkent University, TR-06533, yildiz@ug.bcc.bilkent.edu.tr (2000)"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Zalzala, P.J., Flemming: Zalsala, A.M.S., Ali, M.S. (ed.), Genetic algorithms in engineering systems. Edited by A.M.S. Institution of Electrical Engineers, London (1997)","DOI":"10.1049\/PBCE055E"},{"key":"42_CR14","unstructured":"Hiller, F.S., Lieberman, G.J.: Introduction to Operations Research, International Editions (1995), ISBN: 0-07-113989-3"},{"issue":"11","key":"42_CR15","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"2003","unstructured":"Beasley, J.E.: OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society\u00a041(11), 1069\u20131072 (2003) (last update 2003)","journal-title":"Journal of the Operational Research Society"},{"key":"42_CR16","first-page":"226","volume-title":"CERMA","author":"M.A. Cruz-Ch\u00e1vez","year":"2006","unstructured":"Cruz-Ch\u00e1vez, M.A., Frausto-Sol\u00eds, J., Cora-Mora, J.R.: Experimental Analysis of a Neighborhood Generation Mechanism Applied to Scheduling Problems. In: CERMA, M\u00e9xico, September 2006, vol.\u00a02, pp. 226\u2013229. IEEE Comp. Soc, Los Alamitos (2006)"},{"key":"42_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-70734-4_26","volume-title":"Applied Parallel Computing. New Paradigms for HPC in Industry and Academia","author":"U. Der","year":"2001","unstructured":"Der, U., Steinh\u00f6fel, K.: A Parallel Implementation of Job Shop Scheduling Heuristics. In: S\u00f8revik, T., Manne, F., Moe, R., Gebremedhin, A.H. (eds.) PARA 2000. LNCS, vol.\u00a01947, pp. 215\u2013222. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925231_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:45:37Z","timestamp":1619509537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925231_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490265","9783540490586"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11925231_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}