{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:32:17Z","timestamp":1765355537898,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"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-24664-0_31","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"409-415","source":"Crossref","is-referenced-by-count":13,"title":["A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Ruslan","family":"Sadykov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Baptiste, P., Jouglet, A., Le Pape, C., Nuijten, W.: A constraint-based approach to minimize the weighted number of late jobs on parallel machines. Research Report UTC 2000\/288 (2000)"},{"key":"31_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling: applying constraint programming to scheduling problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling: applying constraint programming to scheduling problems. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"31_CR3","unstructured":"Bockmayr, A., Pisaruk, N.: Detecting infeasibility and generating cuts for MIP using CP. In: 5th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, CPAI- OR 2003, Montreal, Canada (2003)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J.: The one machine sequencing problem. European J. of Oper. Res.\u00a011, 42\u201347 (1982)","journal-title":"European J. of Oper. Res."},{"key":"31_CR5","unstructured":"Colombani, Y., Heipcke, T.: Mosel: an extensible environment for modeling and programming solutions. In: 4th International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimization Problems, CP-AI-OR, Le Croisic, France, pp. 277\u2013290 (2002)"},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S. Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Sevaux, M.: Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Res. Logistics\u00a050(3), 273\u2013288 (2003)","journal-title":"Naval Res. Logistics"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossman, I.E.: Algorithms for hybrid MILP\/CLP models for a class of optimization problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S0377-2217(02)00438-1","volume":"148","author":"L. P\u00e9ridy","year":"2003","unstructured":"P\u00e9ridy, L., Pinson, E., Rivraux, D.: Using short-term memory to minimize the weighted number of late jobs on a single machine. European J. of Oper. Res.\u00a0148, 591\u2013603 (2003)","journal-title":"European J. of Oper. Res."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Sadykov, R., Wolsey, L.: Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem with Deadlines and Release Dates. CORE Discussion Paper 2003\/81 (2003)","DOI":"10.2139\/ssrn.988640"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/S0377-2217(02)00827-5","volume":"151","author":"M. Sevaux","year":"2003","unstructured":"Sevaux, M., Dauz\u00e8re-P\u00e9r\u00e8s, S.: Genetic algorithms to minimize the weighted number of late jobs on a single machine. European J. of Oper. Res.\u00a0151, 296\u2013306 (2003)","journal-title":"European J. of Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:53:52Z","timestamp":1675900432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}