{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T20:59:40Z","timestamp":1721509180595},"reference-count":12,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1051\/ro\/2009025","type":"journal-article","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T09:46:16Z","timestamp":1254908776000},"page":"375-386","source":"Crossref","is-referenced-by-count":2,"title":["France Telecom workforce scheduling problem: a challenge"],"prefix":"10.1051","volume":"43","author":[{"given":"Sebastian","family":"Pokutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautier","family":"Stauffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2009,10,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1057\/jors.1976.30","volume":"27","author":"Baker","year":"1976","journal-title":"Oper. Res. Q."},{"key":"R2","unstructured":"Boost-Library Team, The Boost C++ libraries. http:\/\/www.boost.org\/ (2006)."},{"key":"R3","unstructured":"J. Bedaux, C++ Mersenne Twister pseudo-random number generator, http:\/\/www.bedaux.net\/mtrand\/ (2006)."},{"key":"R4","unstructured":"P.-F. Dutot, A. Laugier and A.-M. Bustos, Technicians and interventions scheduling for telecommunications. http:\/\/www.g-scop.inpg.fr\/ChallengeROADEF2007\/en\/sujet\/sujet2.pdf (2006)."},{"key":"R5","unstructured":"C. Hurkens, Incorporating the strength of MIP modeling in Schedule construction. http:\/\/www.g-scop.inpg.fr\/ChallengeROADEF2007\/TEAMS\/roadef28\/abstract_roadef28.pdf (2007)."},{"key":"R6","unstructured":"ILOG Inc., CPLEX Solver. http:\/\/www.ilog.com (2006)."},{"key":"R7","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"Kolisch","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R8","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"Kolisch","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"H. Mahmoud,P\u00f3lya Urn Models. Taylor & Francis Group LLC \u2013 CRC Press (2008).","DOI":"10.1201\/9781420059847"},{"key":"R10","unstructured":"D. Merkle, M. Middendorf and H. Schmeck, Ant colony optimization for resource-constrained project-scheduling,IEEE Trans. Evol. Comput.6(2002) 333\u2013346."},{"key":"R11","unstructured":"http:\/\/www.g-scop.inpg.fr\/ChallengeROADEF2007\/"},{"key":"R12","unstructured":"E. Tsang and C. Voudouris,Fast local search and guided local search and their application to British Telecom's workforce scheduling problem. Technical Report CSM-246, Department of Computer Science, University of Essex, UK (1995)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2009025\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:50:28Z","timestamp":1558576228000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2009025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":12,"journal-issue":{"issue":"4"},"alternative-id":["ro0934"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2009025","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}