{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:46Z","timestamp":1737436846558,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74484-9_60","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:48:03Z","timestamp":1188337683000},"page":"697-709","source":"Crossref","is-referenced-by-count":4,"title":["A Local Search Algorithm for a SAT Representation of Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Marco Antonio","family":"Cruz-Ch\u00e1vez","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Rivera-L\u00f3pez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","first-page":"496","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization: algorithms and complexity, p. 496. Dover Publications, Mineola (1998)"},{"issue":"2","key":"60_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","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\u00a01(2), 117\u2013129 (1976)","journal-title":"Mathematics of Operations Research"},{"key":"60_CR3","first-page":"371","volume-title":"Scheduling algorithms","author":"P.B. Brucker","year":"2007","unstructured":"Brucker, P.B.: Scheduling algorithms, 5th edn., p. 371. Springer, Heidelberg (2007)","edition":"5"},{"key":"60_CR4","first-page":"941","volume":"17","author":"E. Balas","year":"1969","unstructured":"Balas, E.: Machine Sequencing via Disjunctive Graphs. An Implicit Enumeration Algorithm, Operations Research\u00a017, 941\u2013957 (1969)","journal-title":"An Implicit Enumeration Algorithm, Operations Research"},{"key":"60_CR5","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison Wesley, Massachusetts (1967)"},{"unstructured":"Jalilvand, A., Khanmohammadi, S., Shabaninia, F.: Scheduling of sequence-dependant jobs on parallel multiprocessor systems using a branch and bound-based Petri net, Emerging Technologies. In: Proc of the IEEE, pp. 334\u2013339 (September 17-18, 2005) ISBN: 0-7803-9247-7","key":"60_CR6"},{"unstructured":"Cruz-Ch\u00e1vez, M.A., Frausto-Sol\u00eds, J., Zavala-D\u00edaz, J.C., Sanvicente-S\u00e1nchez, H., Cruz-Rosales, M.H.: A Simulated Annealing Algorithm with Cooperative Processes for Scheduling Problems. ISSADS 2006, LNCS. Springer, Heidelberg ISSN: 0302-9743 (to appear)","key":"60_CR7"},{"doi-asserted-by":"crossref","unstructured":"Zalzala, P.J., Flemming.: Genetic algorithms in engineering systems, in A.M.S. Inst. of Electrical Engineers (1997)","key":"60_CR8","DOI":"10.1049\/PBCE055E"},{"doi-asserted-by":"crossref","unstructured":"Defu, Z., Tangqiu, Li., Shaozi, Li.: An improved shifting bottleneck algorithm for job shop scheduling problem. In: Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design. vol. 2, pp. 1112\u20131116, 24-26 (May 2005)","key":"60_CR9","DOI":"10.1109\/CSCWD.2005.194345"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1018955929512","volume":"83","author":"M.J. Schutten","year":"1988","unstructured":"Schutten, M.J.: Practical job shop scheduling. In Annals of Operations Research\u00a083, 161\u2013177 (1988)","journal-title":"In Annals of Operations Research"},{"unstructured":"El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid Genetic Algorithms: A Review, Engineering Letters (2006) ISSN: 1816-0948, 13:2, EL_13_2_11","key":"60_CR11"},{"unstructured":"Shannon Land, M.W.: Evolutionary Algorithms with Local Search for Combinatorial Optimization, Ph.D. Thesis, University of California, San Diego, p. 169 (1998)","key":"60_CR12"},{"key":"60_CR13","first-page":"987","volume-title":"Proceedings of\u00a0 GECCO 2000","author":"N. Krasnogor","year":"2000","unstructured":"Krasnogor, N., Smith, J.: A Memetic Algorithm With Self-adaptive Local Search: TSP as a case study. In: Whitley, Goldberg, Cantu-Paz, Spector, Parmee, Beyer (eds.) Proceedings of\u00a0 GECCO 2000, pp. 987\u2013994. Morgan Kaufmann, San Francisco (2000)"},{"key":"60_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","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":"60_CR15","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. Journal of Computer System Sciences\u00a010, 384\u2013393 (1975)","journal-title":"Journal of Computer System Sciences"},{"unstructured":"Crawford, J.M., Baker, A.B.: Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems. In: Proc. of the 12th National Conf. on Artificial Intelligence, Austin, TX, pp. 1092\u20131098 (1994)","key":"60_CR16"},{"doi-asserted-by":"crossref","unstructured":"Memik, S.O., Fallah, F.: Accelerated SAT-based scheduling of control\/data flow graphs Computer Design: VLSI in Computers and Processors, pp. 395\u2013400, Proc IEEE (September 16-18, 2002)","key":"60_CR17","DOI":"10.1109\/ICCD.2002.1106801"},{"key":"60_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-540-24768-5_59","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"J. Frausto-Sol\u00eds","year":"2004","unstructured":"Frausto-Sol\u00eds, J., Cruz-Ch\u00e1vez, M.A.: A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems. In: Lagan\u00e0, A., Gavrilova, M., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03046, pp. 553\u2013562. Springer, Heidelberg (2004)"},{"key":"60_CR19","first-page":"340","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1991","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness, p. 340. W.H. Freeman and Company, New York (1991)"},{"unstructured":"Selman, B., Kautz, II, A.: Local search strategies for satisfiability testing. In: Procceding DIMACS Workshop on Maximum Clique, Graph Coloring and Satisfiability (1993)","key":"60_CR20"},{"key":"60_CR21","first-page":"283","volume-title":"SAT","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T., SATLIB,: An Online Resource for Research on SAT. In: Gent, I.P., Maaren, H.v., Walsh, T. (eds.) SAT, pp. 283\u2013292. IOS Press, Amsterdam (2000), SATLIB is available online at www.satlib.org"},{"unstructured":"Beasley, J.E.: OR Library, Imperial College, Management School, Last Update (October 2005) (2007), http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html","key":"60_CR22"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74484-9_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:23:37Z","timestamp":1737397417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74484-9_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744825"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74484-9_60","relation":{},"subject":[]}}