{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T02:40:43Z","timestamp":1685760043680},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s10288-010-0143-7","type":"journal-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T10:16:54Z","timestamp":1283249814000},"page":"317-320","source":"Crossref","is-referenced-by-count":1,"title":["Solving scheduling problems from high-level models"],"prefix":"10.1007","volume":"9","author":[{"given":"Jean-No\u00ebl","family":"Monette","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,1]]},"reference":[{"issue":"3","key":"143_CR1","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.cor.2006.05.009","volume":"35","author":"P Baptiste","year":"2008","unstructured":"Baptiste P, Flamini M, Sourd F (2008) Lagrangian bounds for Just-In-Time Job-Shop scheduling. Comput Oper Res 35(3): 906\u2013915","journal-title":"Comput Oper Res"},{"issue":"8","key":"143_CR2","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.1016\/j.cor.2006.12.019","volume":"35","author":"I Essafi","year":"2008","unstructured":"Essafi I, Mati Y, Dauz\u00e8re-P\u00e8r\u00e9z S (2008) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Comput Oper Res 35(8): 2599\u20132616","journal-title":"Comput Oper Res"},{"issue":"8","key":"143_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.advengsoft.2005.02.002","volume":"36","author":"SQ Liu","year":"2005","unstructured":"Liu SQ, Ong HL, Ng KM (2005) A fast tabu search algorithm for the group shop scheduling problem. Adv Eng Softw 36(8): 533\u2013539","journal-title":"Adv Eng Softw"},{"key":"143_CR4","unstructured":"Monette J-N, Deville Y, Dupont P (2007) A position-based propagator for the open-shop problem. In CPAIOR07: Proceedings of the 4th international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Springer, Berlin, pp 186\u2013199"},{"key":"143_CR5","doi-asserted-by":"crossref","unstructured":"Monette J-N, Deville Y, Van Hentenryck P (2009a) Aeon: Synthesizing scheduling algorithms from high-level models. Operations research and cyber-infrastructure. In: Proceedings of the 11th informs computing society conference, pp 43\u201359","DOI":"10.1007\/978-0-387-88843-9_3"},{"key":"143_CR6","doi-asserted-by":"crossref","unstructured":"Monette J-N, Deville Y, Van Hentenryck P (2009b) Just-In-Time scheduling with constraint programming. In: ICAPS, pp 241\u2013248","DOI":"10.1609\/icaps.v19i1.13356"},{"key":"143_CR7","unstructured":"Valls V, Ballest\u00edn F, Quintanilla S (2003) A hybrid genetic algorithm for the rcpsp. Technical report, Department of Statistics and Operations Research, University of Valencia"},{"key":"143_CR8","volume-title":"Constraint-based local search","author":"P Van Hentenryck","year":"2005","unstructured":"Van Hentenryck P, Michel L (2005) Constraint-based local search. MIT Press, Cambridge"},{"issue":"1","key":"143_CR9","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2006.02.024","volume":"35","author":"CY Zhang","year":"2008","unstructured":"Zhang CY, Li PG, Rao YQ, Guan ZL (2008) A very fast ts\/sa algorithm for the job shop scheduling problem. Comput Oper Res 35(1): 282\u2013294","journal-title":"Comput Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0143-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-010-0143-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-010-0143-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T02:23:55Z","timestamp":1685759035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-010-0143-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,1]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["143"],"URL":"https:\/\/doi.org\/10.1007\/s10288-010-0143-7","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,1]]}}}