{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:16:10Z","timestamp":1774926970516,"version":"3.50.1"},"reference-count":37,"publisher":"International Academy Publishing (IAP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.8.4.851-858","type":"journal-article","created":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T21:39:33Z","timestamp":1364852373000},"source":"Crossref","is-referenced-by-count":4,"title":["Solving the Employee Timetabling Problem Using Advanced SAT & ILP Techniques"],"prefix":"10.17706","volume":"8","author":[{"given":"Fadi A.","family":"Aloul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed Z. H.","family":"Zahidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anas","family":"Al-Farra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Basel","family":"Al-Roh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bashar","family":"Al-Rawi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2013,4,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00095-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024460714760"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602525"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.06.035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44629-X_15"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.046"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/07408170490438410"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46238-4_33"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.12.013"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.08.013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000030684.30824.08"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.12.007"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1075"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-008-0087-9"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/11814948_13","article-title":"Applications of SAT solver to Cryptanalysis of Hash Functions","volume-title":"International Conference on Theory and Applications of Satisfiability Testing","author":"Mironov","year":"2006","unstructured":"[20] I. Mironov and L. Zhang, \"Applications of SAT solver to Cryptanalysis of Hash Functions,\" in International Conference on Theory and Applications of Satisfiability Testing, 2006."},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126611007980"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0675-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718546"},{"key":"ref21","article-title":"A fast pseudo-boolean constraint","volume-title":"Design Automation Conference","author":"Chai","year":"2003","unstructured":"[25] D. Chai and A. Kuehlmann, \"A fast pseudo-boolean constraint,\" in Design Automation Conference, 2003."},{"key":"ref22","article-title":"An extensible SAT-solver","volume-title":"Int l Conf on Theory and Applications of Satisfiability Testing","author":"Een","year":"2003","unstructured":"[26] N. Een and N. Sorensson, \"An extensible SAT-solver,\" in Int'l Conf. on Theory and Applications of Satisfiability Testing, 2003."},{"key":"ref23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.3233\/SAT190023","article-title":"On using cutting planes in pseudo Boolean optimization","volume":"2","author":"Manquinho","year":"2006","unstructured":"[27] V. Manquinho and J. Marques-Silva, \"On using cutting planes in pseudo Boolean optimization,\" Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, pp. 209-219, 2006.","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"issue":"no. 1-4","key":"ref24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/SAT190020","article-title":"Pueblo: A Hybrid Pseudo-Boolean SAT Solver","volume":"2","author":"Sheini","year":"2006","unstructured":"[28] H. Sheini and K. Sakallah, \"Pueblo: A Hybrid Pseudo-Boolean SAT Solver,\" Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, no. 1-4, pp. 165-189, 2006.","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"ref25","volume-title":"Introduction to Digital Logic Design","author":"Hayes","year":"1993","unstructured":"[29] J. Hayes, Introduction to Digital Logic Design, Addison-Wesley, 1993."},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1145\/378239.379017","article-title":"Chaff: engineering an efficient SAT solver","volume-title":"Design Automation Conference","author":"Moskewicz","year":"2001","unstructured":"[30] K. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, \"Chaff: engineering an efficient SAT solver,\" in Design Automation Conference, 2001."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"ref28","article-title":"A new clause learning scheme for efficient unsatisfiability proofs","volume-title":"Conference on Artificial Intelligence","author":"Pipatsrisawat","year":"2008","unstructured":"[32] A. Pipatsrisawat and A. Darwiche, \"A new clause learning scheme for efficient unsatisfiability proofs,\" in Conference on Artificial Intelligence, 2008."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref30","article-title":"The complexity of theorem proving procedures","volume-title":"Symposium on the Theory of Computing","author":"Cook","year":"2004","unstructured":"[35] S. A. Cook, \"The complexity of theorem proving procedures,\" in Symposium on the Theory of Computing, 2004."},{"key":"ref30","unstructured":"[9] S.-C. Chu, Y.-T. Chen and J.-H. Ho, \"Timetable scheduling using particle swarm optimization,\" in International conference on innovative computing, information and control, 2006."},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"[10] D. Qarouni-Fard, A. Najafi-Ardabili and M. Moeinzadeh, \"Finding feasible timetables with particle swarm optimization,\" in International Conference on innovations in information technology, 2007.","DOI":"10.1109\/IIT.2007.4430422"},{"key":"ref30","unstructured":"[16] F. Jacobsen, A. Bortfeldt and H. Gehring, \"Timetabling at German secondary schools: Tabu search versus constraint programming,\" in International conference on the practise and theory of automated timetabling, 2006."},{"key":"ref30","doi-asserted-by":"crossref","unstructured":"[23] F. Aloul and M. El-Tarhuni, \"Multipath Detection Using Boolean Satisfiability Techniques,\" Journal of Computer Networks and Communications, no. Article ID 365107, 2011.","DOI":"10.1155\/2011\/365107"},{"key":"ref30","unstructured":"[33] E. Goldberg and Y. Novikov, \"BerkMin: a fast and Robust SAT-solver,\" in Design Automation and Test in Europe Conference, 2002."},{"key":"ref30","unstructured":"[36] IBM ILOG CPLEX Optimizer, 2011. [Online]. http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"ref30","unstructured":"[37] \"SCIP: An Open Source MIP Solver and constraint integer programming framework,\" 2011.[Online]. http:\/\/scip.zib.de\/"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T17:26:01Z","timestamp":1595611561000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/8406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":37,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2013,4,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.8.4.851-858","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}