{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:42:01Z","timestamp":1725565321994},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220602"},{"type":"electronic","value":"9783540247685"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24768-5_59","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T21:14:08Z","timestamp":1284153248000},"page":"553-562","source":"Crossref","is-referenced-by-count":1,"title":["A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Juan","family":"Frausto-Solis","sequence":"first","affiliation":[]},{"given":"Marco Antonio","family":"Cruz-Chavez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"59_CR1","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 Operation Research\u00a01(2), 117\u2013129 (1976)","journal-title":"Mathematics of Operation Research"},{"key":"59_CR2","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, Reading (1967)"},{"key":"59_CR3","unstructured":"Smith, S.F., Cheng, C.C.: Slack-Based Heuristics for Constraint Satisfaction Scheduling. In: Proc. of the 11th National Conf. on Artificial Intelligence, Washington, D.C., pp. 139\u2013145 (1993)"},{"key":"59_CR4","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"},{"key":"59_CR5","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)"},{"issue":"1","key":"59_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.25.1.45","volume":"25","author":"S.S. Panwalker","year":"1977","unstructured":"Panwalker, S.S., Iskander, W.: A survey of scheduling rules. Operations Research\u00a025(1), 45\u201361 (1977)","journal-title":"Operations Research"},{"issue":"3","key":"59_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"E. Adams","year":"1988","unstructured":"Adams, E., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science\u00a034(3), 391\u2013401 (1988)","journal-title":"Management Science"},{"key":"59_CR8","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. Annals of Operations Research\u00a083, 161\u2013177 (1988)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"59_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An algorithm for solving the job-shop problem. Management Sciences\u00a035(2), 164\u2013176 (1989)","journal-title":"Management Sciences"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Yamada, T., Nakano, R.: Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search. In: Metaheuristics Int. Conference, Colorado, USA, pp. 344\u2013349 (1995)","DOI":"10.1007\/978-1-4613-1361-8_15"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Zalzala, P.J.: Flemming: Genetic algorithms in engineering systems. A.M.S. Inst. of Electrical Engineers (1997)","DOI":"10.1049\/PBCE055E"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Jones, A., Rabelo, L.C.: Survey of Job Shop Scheduling Techniques. NISTIR, National Institute of Standards and Technology, Gaithersburg, MD (1998), http:\/\/www.mel.nist.gov\/msidlibrary\/summary\/authlist.htm","DOI":"10.1002\/047134608X.W3352"},{"key":"59_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley Pub. Co., USA (1994) ISBN 0-201-53082-1"},{"key":"59_CR14","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceeding of the Tenth National Conference on Artificial Intelligence, pp. 139\u2013144 (1992)"},{"key":"59_CR15","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":"59_CR16","doi-asserted-by":"crossref","unstructured":"Davis, M., Logeman, G., Loveland, D.: A machine Program for theorem proving. In: CACM, pp. 394\u2013397 (1962)","DOI":"10.1145\/368273.368557"},{"key":"59_CR17","doi-asserted-by":"publisher","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\u00a017, 941\u2013957 (1969)","journal-title":"Operations Research"},{"key":"59_CR18","volume-title":"Computers and Intractability: A Guide of the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide of the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"59_CR19","unstructured":"Beasley, J.E.: OR Library, Imperial College, Management School (1990), http:\/\/mscmga.ms.ic.ac.uk\/info.html"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24768-5_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T03:28:30Z","timestamp":1685762910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24768-5_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220602","9783540247685"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24768-5_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}