{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T21:16:43Z","timestamp":1769548603444,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s12351-018-0412-3","type":"journal-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T03:32:38Z","timestamp":1529379158000},"page":"2109-2132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints"],"prefix":"10.1007","volume":"20","author":[{"given":"Mohamed Amine","family":"Abdeljaoued","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nour El Houda","family":"Saadani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2832-3672","authenticated-orcid":false,"given":"Zied","family":"Bahroun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"3","key":"412_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10951-010-0162-4","volume":"14","author":"A Agnetis","year":"2011","unstructured":"Agnetis A, Flamini M, Nicosia G, Pacifici A (2011) A job-shop problem with one additional resource type. J Sched 14(3):225\u2013237","journal-title":"J Sched"},{"issue":"1","key":"412_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Kan AHGR (1983) Scheduling subject to resource constraints: classification and complexity. Discr Appl Math 5(1):11\u201324. \nhttps:\/\/doi.org\/10.1016\/0166-218X(83)90012-4","journal-title":"Discr Appl Math"},{"issue":"5","key":"412_CR3","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF00263292","volume":"24","author":"J Blazewicz","year":"1987","unstructured":"Blazewicz J, Kubiak W, R\u00f6ck H, Szwarcfiter J (1987) Minimizing mean flow time with parallel processors and resource constraints. Acta Informatica 24(5):513\u2013524","journal-title":"Acta Informatica"},{"issue":"2\u20133","key":"412_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0166-218X(93)90042-M","volume":"42","author":"J B\u0142azewicz","year":"1993","unstructured":"B\u0142azewicz J, Kubiak W, Martello S (1993) Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discr Appl Math 42(2\u20133):123\u2013138. \nhttps:\/\/doi.org\/10.1016\/0166-218X(93)90042-M","journal-title":"Discr Appl Math"},{"issue":"3","key":"412_CR5","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ejor.2007.02.057","volume":"189","author":"H Br\u00e4sel","year":"2008","unstructured":"Br\u00e4sel H, Herms A, M\u00f6rig M, Tautenhahn T, Tusch J, Werner F (2008) Heuristic constructive algorithms for open shop scheduling to minimize mean flow time. Eur J Oper Res 189(3):856\u2013870. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2007.02.057","journal-title":"Eur J Oper Res"},{"key":"412_CR6","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.procir.2013.09.077","volume":"12","author":"FA Cappadonna","year":"2013","unstructured":"Cappadonna FA, Costa A, Fichera S (2013) Makespan minimization of unrelated parallel machines with limited human resources. Procedia CIRP 12:450\u2013455. \nhttps:\/\/doi.org\/10.1016\/j.procir.2013.09.077","journal-title":"Procedia CIRP"},{"issue":"2","key":"412_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1080\/00207540601138452","volume":"46","author":"G Celano","year":"2008","unstructured":"Celano G, Costa A, Fichera S (2008) Scheduling of unrelated parallel manufacturing cells with limited human resources. Int J Prod Res 46(2):405\u2013427","journal-title":"Int J Prod Res"},{"issue":"9","key":"412_CR8","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1287\/mnsc.42.9.1260","volume":"42","author":"RL Daniels","year":"1996","unstructured":"Daniels RL, Hoopes BJ, Mazzola JB (1996) Scheduling parallel manufacturing cells with resource flexibility. Manag Sci 42(9):1260\u20131276. \nhttps:\/\/doi.org\/10.1287\/mnsc.42.9.1260","journal-title":"Manag Sci"},{"issue":"3","key":"412_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U Dorndorf","year":"2001","unstructured":"Dorndorf U, Pesch E, Phan-Huy T (2001) Solving the open shop scheduling problem. J Sched 4(3):157\u2013174. \nhttps:\/\/doi.org\/10.1002\/jos.73","journal-title":"J Sched"},{"issue":"3","key":"412_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ejor.2013.02.042","volume":"230","author":"EB Edis","year":"2013","unstructured":"Edis EB, Oguz C, Ozkarahan I (2013) Parallel machine scheduling with additional resources: notation, classification, models and solution methods. Eur J Oper Res 230(3):449\u2013463. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2013.02.042","journal-title":"Eur J Oper Res"},{"key":"412_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"RW Eglese","year":"1990","unstructured":"Eglese RW (1990) Simulated annealing: a tool for operational research. Eur J Oper Res 46:271\u2013281","journal-title":"Eur J Oper Res"},{"key":"412_CR12","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to ROC analysis. Pattern Recogn Lett 27:861\u2013874","journal-title":"Pattern Recogn Lett"},{"key":"412_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11496915_14","volume-title":"Integer programming and combinatorial optimization","author":"A Grigoriev","year":"2005","unstructured":"Grigoriev A, Sviridenko M, Uetz M (2005) Unrelated parallel machine scheduling with resource dependent processing times. In: Junger M, Kaibel V (eds) Integer programming and combinatorial optimization. Springer, Berlin, pp 182\u2013195"},{"key":"412_CR14","unstructured":"Guinet A, Saadani NEH (2010) Nomadisme chirurgical et ordonnancement de blocs op\u00e9ratoires. In: Proceeding of Conf\u00e9rence francophone en Gestion et Ing\u00e9nierie des Syst\u00e8mes Hospitaliers. GISEH, Clermont-Ferrand, France"},{"issue":"3","key":"412_CR15","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1016\/S0377-2217(96)00247-0","volume":"102","author":"J Herrmann","year":"1997","unstructured":"Herrmann J, Proth J, Sauer N (1997) Heuristics for unrelated machine scheduling with precedence constraints. Eur J Oper Res 102(3):528\u2013537. \nhttps:\/\/doi.org\/10.1016\/S0377-2217(96)00247-0","journal-title":"Eur J Oper Res"},{"issue":"1\u20133","key":"412_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(03)00433-5","volume":"133","author":"H Kellerer","year":"2003","unstructured":"Kellerer H, Strusevich VA (2003) Scheduling problems for parallel dedicated machines under multiple resource constraints. Discr Appl Math 133(1\u20133):45\u201368. \nhttps:\/\/doi.org\/10.1016\/S0166-218X(03)00433-5","journal-title":"Discr Appl Math"},{"issue":"5","key":"412_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10951-011-0231-3","volume":"14","author":"SA Kravchenko","year":"2011","unstructured":"Kravchenko SA, Werner F (2011) Parallel machine problems with equal processing times: a survey. J Sched 14(5):435\u2013444. \nhttps:\/\/doi.org\/10.1007\/s10951-011-0231-3","journal-title":"J Sched"},{"issue":"4","key":"412_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10288-010-0149-1","volume":"8","author":"K Lee","year":"2010","unstructured":"Lee K, Leung JYT, Pinedo ML (2010) Makespan minimization in online scheduling with machine eligibility. 4OR-Q J Oper Res 8(4):331\u2013364. \nhttps:\/\/doi.org\/10.1007\/s10288-010-0149-1","journal-title":"4OR-Q J Oper Res"},{"key":"412_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/s0167-5060(08)70743-x","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343\u2013362. \nhttps:\/\/doi.org\/10.1016\/s0167-5060(08)70743-x","journal-title":"Ann Discret Math"},{"issue":"8","key":"412_CR20","doi-asserted-by":"publisher","first-page":"5551","DOI":"10.1016\/j.asoc.2011.05.005","volume":"11","author":"K Li","year":"2011","unstructured":"Li K, Shi Y, Yang S, Cheng B (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551\u20135557. \nhttps:\/\/doi.org\/10.1016\/j.asoc.2011.05.005","journal-title":"Appl Soft Comput"},{"issue":"4","key":"412_CR21","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1080\/00207543.2013.848305","volume":"52","author":"Y Lin","year":"2014","unstructured":"Lin Y, Hsieh F (2014) Unrelated parallel machine scheduling with setup times and ready times. Int J Prod Res 52(4):1200\u20131214. \nhttps:\/\/doi.org\/10.1080\/00207543.2013.848305","journal-title":"Int J Prod Res"},{"issue":"1","key":"412_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6(1):1\u201312. \nhttps:\/\/doi.org\/10.1287\/mnsc.6.1.1","journal-title":"Manag Sci"},{"issue":"2","key":"412_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.ejor.2014.12.002","volume":"243","author":"A Mensendiek","year":"2015","unstructured":"Mensendiek A, Gupta JND, Herrmann J (2015) Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness. Eur J Oper Res 243(2):514\u2013522. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2014.12.002","journal-title":"Eur J Oper Res"},{"key":"412_CR24","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia Pac J Oper Res 18:193\u2013242","journal-title":"Asia Pac J Oper Res"},{"key":"412_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cor.2009.04.010","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ghomi FSMT, Aminnayeri M, Zandieh M (2010) A contribution and new heuristics for open-shop scheduling. Comput Oper Res 37:213\u2013221","journal-title":"Comput Oper Res"},{"issue":"1","key":"412_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395. \nhttps:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"issue":"3","key":"412_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0191-2615(90)90014-P","volume":"24","author":"RI Peterkofsky","year":"1990","unstructured":"Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transp Res Part B Methodol 24(3):159\u2013172. \nhttps:\/\/doi.org\/10.1016\/0191-2615(90)90014-P","journal-title":"Transp Res Part B Methodol"},{"issue":"3","key":"412_CR28","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1080\/10170660409509404","volume":"21","author":"M Pfund","year":"2004","unstructured":"Pfund M, Fowler JW, Gupta JND (2004) Multi-objective unrelated parallel machine deterministic scheduling problems. J Chin Inst Ind Eng 21(3):230\u2013241. \nhttps:\/\/doi.org\/10.1080\/10170660409509404","journal-title":"J Chin Inst Ind Eng"},{"issue":"2","key":"412_CR29","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ejor.2006.03.028","volume":"179","author":"AJ Ruiz-Torres","year":"2007","unstructured":"Ruiz-Torres AJ, L\u00f3pez FJ, Ho JC (2007) Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs. Eur J Oper Res 179(2):302\u2013315. \nhttps:\/\/doi.org\/10.1016\/j.ejor.2006.03.028","journal-title":"Eur J Oper Res"},{"issue":"13","key":"412_CR30","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1016\/S0305-0548(02)00118-1","volume":"30","author":"JA Ventura","year":"2003","unstructured":"Ventura JA, Kim D (2003) Parallel machine scheduling with earliness\u2013tardiness penalties and additional resource constraints. Comput Oper Res 30(13):1945\u20131958. \nhttps:\/\/doi.org\/10.1016\/S0305-0548(02)00118-1","journal-title":"Comput Oper Res"},{"issue":"8","key":"412_CR31","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1016\/j.apm.2014.10.012","volume":"39","author":"W Yeh","year":"2015","unstructured":"Yeh W, Chuang M, Lee W (2015) Uniform parallel machine scheduling with resource consumption constraint. Appl Math Model 39(8):2131\u20132138. \nhttps:\/\/doi.org\/10.1016\/j.apm.2014.10.012","journal-title":"Appl Math Model"},{"issue":"2","key":"412_CR32","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"L Zhang","year":"2016","unstructured":"Zhang L, Lu L (2016) Parallel-machine scheduling with release dates and rejection. 4OR-Q J Oper Res 14(2):165\u2013172. \nhttps:\/\/doi.org\/10.1007\/s10288-016-0304-4","journal-title":"4OR-Q J Oper Res"},{"key":"412_CR33","doi-asserted-by":"publisher","unstructured":"Zhong X, Ou J (2016) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR-Q J Oper Res. \nhttps:\/\/doi.org\/10.1007\/s10288-016-0339-6","DOI":"10.1007\/s10288-016-0339-6"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0412-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-018-0412-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-018-0412-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T18:36:41Z","timestamp":1602268601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-018-0412-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,19]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["412"],"URL":"https:\/\/doi.org\/10.1007\/s12351-018-0412-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,19]]},"assertion":[{"value":"31 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}