{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T04:06:38Z","timestamp":1774065998894,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T00:00:00Z","timestamp":1337040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10479-012-1132-3","type":"journal-article","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T06:33:38Z","timestamp":1336977218000},"page":"147-171","source":"Crossref","is-referenced-by-count":38,"title":["Solving an integrated job-shop problem with human resource constraints"],"prefix":"10.1007","volume":"213","author":[{"given":"Olivier","family":"Guyon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Lemaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Pinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Rivreau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,15]]},"reference":[{"key":"1132_CR1","first-page":"711","volume":"29","author":"H. K. Alfares","year":"1997","unstructured":"Alfares, H. K., & Bailey, J. E. (1997). Integrated project task and manpower scheduling. IIE Transactions, 29, 711\u2013717.","journal-title":"IIE Transactions"},{"key":"1132_CR2","unstructured":"Aggoune, R. (2002). Ordonnancement d\u2019ateliers sous contraintes de disponibilit\u00e9 des machines. PhD thesis, Universit\u00e9 de Metz."},{"key":"1132_CR3","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/S0377-2217(03)00261-3","volume":"153","author":"R. Aggoune","year":"2004","unstructured":"Aggoune, R. (2004a). Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research, 153, 534\u2013543.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR4","unstructured":"Aggoune, R. (2004b). Une proc\u00e9dure par s\u00e9paration et \u00e9valuation pour l\u2019ordonnancement d\u2019un job-shop sous contraintes de disponibilit\u00e9. In Proceedings of 5e conf\u00e9rence Francophone de MOd\u00e9lisation et SIMulation, MOSIM\u201904, Nantes, France."},{"key":"1132_CR5","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1016\/j.cor.2008.08.013","volume":"36","author":"C. Artigues","year":"2009","unstructured":"Artigues, C., Gendreau, M., Rousseau, L.-M., & Vergnaud, A. (2009). Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound. Computers & Operations Research, 36, 2330\u20132340.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1132_CR6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(4), 238\u2013252.","journal-title":"Numerische Mathematik"},{"issue":"3","key":"1132_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0377-2217(88)90192-0","volume":"37","author":"J. Blazewicz","year":"1988","unstructured":"Blazewicz, J., Finke, G., Haupt, R., & Schmidt, G. (1988). New trends in machine scheduling. European Journal of Operational Research, 37(3), 303\u2013317.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR8","unstructured":"Carlier, J. (1975). Ordonnancement \u00e0 contraintes disjonctives. Th\u00e8se de 3\u00e8me cycle. PhD thesis, Paris VI."},{"key":"1132_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000030685.31167.11","volume":"129","author":"Z.-L. Chen","year":"2004","unstructured":"Chen, Z.-L. (2004). Simultaneous job scheduling and resource allocation on parallel machines. Annals of Operations Research, 129, 135\u2013153.","journal-title":"Annals of Operations Research"},{"key":"1132_CR11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., & Pinson, \u00c9. (1989). An algorithm for solving the job-shop problem. Management Science, 35, 164\u2013176.","journal-title":"Management Science"},{"key":"1132_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, \u00c9. (1990). A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem. Annals of Operations Research, 26, 169\u2013287.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1132_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., & Pinson, \u00c9. (1994). Adjustement of heads and tails for the job-shop problem. European Journal of Operational Research, 78(2), 146\u2013161.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR14","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"J. Carlier","year":"2004","unstructured":"Carlier, J., P\u00e9ridy, L., Pinson, \u00c9., & Rivreau, D. (2004). Elimination rules for job-shop scheduling problem: overview and extensions. In Handbook of scheduling: algorithms, models and performance analysis. Boca Raton: CRC Press (Chap.\u00a04)."},{"key":"1132_CR15","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1287\/opre.42.3.504","volume":"42","author":"R. L. Daniels","year":"1994","unstructured":"Daniels, R. L., & Mazzola, J. B. (1994). Flow shop scheduling with resource flexibility. Operations Research, 42, 504\u2013522.","journal-title":"Operations Research"},{"key":"1132_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A. T. Ernst","year":"2004","unstructured":"Ernst, A. T., Houyuan, J., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153, 3\u201327.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.dam.2004.12.003","volume":"148","author":"A. Gharbi","year":"2005","unstructured":"Gharbi, A., & Haouari, M. (2005). Optimal parallel machines scheduling with availability constraints. Discrete Applied Mathematics, 148, 63\u201387.","journal-title":"Discrete Applied Mathematics"},{"key":"1132_CR18","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"issue":"2","key":"1132_CR19","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.ejor.2009.03.013","volume":"201","author":"O. Guyon","year":"2010","unstructured":"Guyon, O., Lemaire, P., Pinson, \u00c9., & Rivreau, D. (2010). Cut generation for an integrated employee timetabling and production scheduling problem. European Journal of Operational Research, 201(2), 557\u2013567.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J. N. Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic based Benders decomposition. Mathematical Programming Series A, 96, 33\u201360.","journal-title":"Mathematical Programming Series A"},{"key":"1132_CR21","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"J. N. Hooker","year":"2005","unstructured":"Hooker, J. N. (2005). A hybrid method for planning and scheduling. Constraints, 10, 385\u2013401.","journal-title":"Constraints"},{"key":"1132_CR22","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J. N. Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and scheduling by logic-based benders decomposition. Operations Research, 55, 588\u2013602.","journal-title":"Operations Research"},{"key":"1132_CR23","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"C.-Y. Lee","year":"1996","unstructured":"Lee, C.-Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395\u2013416.","journal-title":"Journal of Global Optimization"},{"key":"1132_CR24","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"J. Y.-T. Leung","year":"2004","unstructured":"Leung, J. Y.-T. (2004). Handbook of scheduling: algorithms, models and performance analysis. Boca Raton: CRC Press."},{"key":"1132_CR25","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.ejor.2006.11.027","volume":"184","author":"L.-W. Liao","year":"2008","unstructured":"Liao, L.-W., & Sheen, G.-J. (2008). Parallel machine scheduling with machine availability and eligibility constraints. European Journal of Operational Research, 184, 458\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10951-005-6812-2","volume":"8","author":"P. Maugui\u00e8re","year":"2005","unstructured":"Maugui\u00e8re, P., Billaut, J.-C., & Bouquard, J.-L. (2005). New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling, 8, 211\u2013231.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"1132_CR27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y. Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199\u2013211.","journal-title":"Computers & Industrial Engineering"},{"key":"1132_CR28","first-page":"389","volume-title":"Proceedings of the 5th international IPCO conference","author":"P. Martin","year":"1996","unstructured":"Martin, P., & Shmoys, D. B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Proceedings of the 5th international IPCO conference (pp. 389\u2013403)."},{"key":"1132_CR29","volume-title":"Scheduling: theory, algorithms and systems","author":"M. Pinedo","year":"2004","unstructured":"Pinedo, M. (2004). Scheduling: theory, algorithms and systems (2nd ed.). New York: Prentice Hall.","edition":"2"},{"key":"1132_CR30","unstructured":"Rivreau, D. (1999). Probl\u00e8mes d\u2019ordonnancement disjonctifs: r\u00e8gles d\u2019\u00e9limination et bornes inf\u00e9rieures. PhD thesis, Universit\u00e9 de Technologie de Compi\u00e8gne."},{"key":"1132_CR31","volume-title":"Machine scheduling problems: classification, complexity and computation","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan, A. H. G. (1976). Machine scheduling problems: classification, complexity and computation. Norwell: Kluwer Academic."},{"key":"1132_CR32","unstructured":"Roy, B., & Sussman, B. (1964). Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjonctives."},{"issue":"4","key":"1132_CR33","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M. W. P. Savelsbergh","year":"1994","unstructured":"Savelsbergh, M. W. P. (1994). Preprocessing and probing techniques for mixed integer programming problems. INFORMS Journal on Computing, 6(4), 445\u2013454.","journal-title":"INFORMS Journal on Computing"},{"key":"1132_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1\u201315.","journal-title":"European Journal of Operational Research"},{"key":"1132_CR35","volume-title":"Gestion des horaires et affectation du personnel","author":"F. Soumis","year":"2005","unstructured":"Soumis, F., Pesant, G., & Rousseau, L.-M. (2005). Gestion de production et ressources humaines. In Gestion des horaires et affectation du personnel. Montreal: Presses Internationales Polytechnique (Chap.\u00a04)."},{"key":"1132_CR36","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s002360050143","volume":"35","author":"\u00c9. Sanlaville","year":"1998","unstructured":"Sanlaville, \u00c9., & Schmidt, G. (1998). Machine scheduling with availability constraints. Acta Informatica, 35, 795\u2013811.","journal-title":"Acta Informatica"},{"key":"1132_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G. Wang","year":"2005","unstructured":"Wang, G., Sun, H., & Chu, C. (2005). Preemptive scheduling with availability constraints to minimize total weighted completion times. Annals of Operations Research, 133, 183\u2013192.","journal-title":"Annals of Operations Research"},{"key":"1132_CR38","unstructured":"Zribi, N. (2005). Ordonnancement des job-shops flexibles sous contraintes de disponibilit\u00e9 des machines. PhD thesis, Universit\u00e9 des sciences et technologies de Lille."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1132-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1132-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1132-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T15:39:34Z","timestamp":1642261174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1132-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,15]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["1132"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1132-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,15]]}}}