{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:53:41Z","timestamp":1648724021524},"reference-count":24,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1051\/ro\/2015013","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T02:46:32Z","timestamp":1430275592000},"page":"83-90","source":"Crossref","is-referenced-by-count":1,"title":["Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods"],"prefix":"10.1051","volume":"50","author":[{"given":"Rachid","family":"zitouni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omar","family":"selt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2015,12,7]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Adamu M.O. and Abass O., Parallel machine sheduling to maximize the weighted number of just-in-time jobs.J. Appl. Sci. Technol.15(2010) 12\u201334.","DOI":"10.4314\/jast.v15i1-2.54819"},{"key":"R2","unstructured":"Adamu M.O. and Adewumi A., Metaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs.Int. J. Phys. Sci.7(2012) 1641\u20131652."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"Adamu M. and Adewunmi A., A Comparative study of metaheuristics for identical parallel machines.J. Eng. Technol. Res.5(2013) 207\u2013216.","DOI":"10.5897\/JETR2013.0295"},{"key":"R4","unstructured":"P. Baptiste, A. Jouglet, CL. Pape and W. Nuijten,A constraint based approach to minimize the weighted number of late jobs on parallel machines.Technical Report 2000\/228, UMR, CNRS 6599, Heudiasyc, France (2000)."},{"key":"R5","unstructured":"Belouadah H., Posner M.E. and Potts C.N., Scheduling with relates dates on a single machine to minimize total weighted completion time.Discrete Appl. Math.36(1992) 213\u2013231."},{"key":"R6","unstructured":"J. Carlier and P. Chr\u00e9tienne, Probl\u00e8mes d\u2019ordonnancement: Mod\u00e9lisation, Complexit\u00e9, Algorithmes. Masson, France (1988)."},{"key":"R7","unstructured":"Glover F., Futurepathsfo rinteger programming and links to artificial intelligence.Comput. Open Res.13(1986) 533\u2013549."},{"key":"R8","unstructured":"Glover F. and Hanafi S., Tabu Search and Finite Convergence. Special Issue on \u201cFoundations of heuristics in Combinatorial Optimization\u201d.Discrete Appl. Math.119(2002) 3\u201336."},{"key":"R9","unstructured":"P. Hansen, The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming. InProc. of the Congress on Numerical Methods(1986)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Haouari M. and Ladhari T., Branch and bound-based local search method for the flow shop probl\u00e8me.J. Oper. Res. Soc.54(2003) 1076\u20131084.","DOI":"10.1057\/palgrave.jors.2601612"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Hertz A. and Widmer M., Guidelines for the use metaheuristics in combinatorial optimization.Eur. J. Oper. Res.151(2003) 247\u201352.","DOI":"10.1016\/S0377-2217(02)00823-8"},{"key":"R12","unstructured":"Ho J.C. and Chang Y.L., Minimizing the number of tardy jobs for m parallel machines.Eur. J. Oper. Res.84(1995) 334\u2013355."},{"key":"R13","unstructured":"F. Laburthe, Contraintes et algorithmes en optimisation combinatoire. Ph.D. thesis. University Paris VII, France (1988)."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Lee C.Y., Machine scheduling with an availability constraints.J. Global Optim.9(1996) 395\u2013416.","DOI":"10.1007\/BF00121681"},{"key":"R15","unstructured":"Lee C.Y., Minimizing the makespan in two machines flow shop scheduling problem with availability constraints.Oper. Res. Lett.20(1997) 129\u2013139."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Lee C.Y., Two machines flow shop scheduling problem with availability constraints.Eur. J. Oper. Res.114(1999) 420\u2013429.","DOI":"10.1016\/S0377-2217(97)00452-9"},{"key":"R17","unstructured":"Lee C.Y. and Chen Z.L., Scheduling jobs and maintenance activities on parallel machines.Naval Res. Logist.47(2000) 145\u2013165."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"M\u2019Hallah R. and Bulfin R.L., Minimizing the weighted number of tardy jobs of parallel processors.Eur. J. Oper. Res.160(2005) 471\u2013484.","DOI":"10.1016\/j.ejor.2003.06.027"},{"key":"R19","unstructured":"C. Sadfi,Probl\u00e8mes d\u2019ordonnancement avec minimisation des encours.Ph.D. thesis. Institut National Polytechnique de Grenoble, France (2002)."},{"key":"R20","unstructured":"M. Sakarovitch, Optimisation combinatoire: Programmation discr\u00e8te. Hermann, France (1984)."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Schmidt G., Scheduling on semi-identical processors.Z. Oper. Res.A28(1984) 153\u2013162.","DOI":"10.1007\/BF01920917"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Schmidt G., Scheduling with limited machine availability.Eur. J. Oper. Res.121(2000) 1\u201315.","DOI":"10.1016\/S0377-2217(98)00367-1"},{"key":"R23","unstructured":"Smith W.E., Various optimizes for single-stage production.Naval Res. Logist.3(1956) 59\u201366."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Yun-Chia L., Yu-Ming H. and Chia-Yun T., Metaheuristics for drilling operation scheduling in Taiwan PCB industries.Int. J. Prod. Econ.141(2013) 189\u2013198.","DOI":"10.1016\/j.ijpe.2012.04.014"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015013\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T03:19:22Z","timestamp":1566616762000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,7]]},"references-count":24,"journal-issue":{"issue":"1"},"alternative-id":["ro150013"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015013","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,7]]}}}