{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:37:53Z","timestamp":1781105873269,"version":"3.54.1"},"reference-count":34,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,4,1]]},"abstract":"<p>In this paper, the authors\u2019 interest is focused on the scheduling problem on identical parallel machines with consumable resources in order to minimize the makespan criterion. Each job consumes several components which arrive at different times. The arrival of each component is represented by a curve-shaped staircase. This problem is NP-hard, further, there are not universal methods making it possible to solve all the cases effectively, especially for medium or large instances. A genetic algorithm is proposed to solve this problem due to proven great performance in solving combinatorial optimization problems. To check its effectiveness this algorithm is compared with an exact resolution method which enumerates all possible solutions for small instances and with a heuristic for large instances. Various randomly generated instances, which can represent realistic situations, are tested. The computation results show that this algorithm outperforms heuristic procedure and is tailored for larger scale problems.<\/p>","DOI":"10.4018\/jamc.2013040102","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T08:55:27Z","timestamp":1379321727000},"page":"17-30","source":"Crossref","is-referenced-by-count":8,"title":["A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources"],"prefix":"10.4018","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3531-3931","authenticated-orcid":true,"given":"Fay\u00e7al","family":"Belkaid","sequence":"first","affiliation":[{"name":"Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zaki","family":"Sari","sequence":"additional","affiliation":[{"name":"Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Souier","sequence":"additional","affiliation":[{"name":"Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria, & Tlemcen Preparatory School of Economics, Tlemcen, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jamc.2013040102-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"jamc.2013040102-1","doi-asserted-by":"crossref","unstructured":"Belkaid, F., Yalaoui, F., & Sari, Z. (2012). A genetic algorithm for parallel machine scheduling with consumable resources to minimize makespan. In Proceedings of the 4th International Conference on Metaheuristics and Nature Inspired Computing, META 2012, Sousse, Tunisia.","DOI":"10.1109\/CoDIT.2013.6689534"},{"key":"jamc.2013040102-2","first-page":"3","article-title":"Solving rcpsp with resources production possibility by tasks. In Proceedings of the MHOSI'2005, Hammamet, Tunisia, Brucker, P., Drexl, A., Mohring, R., Neumann, K., & Pesch, E. (1999). Resource constrained project scheduling: Notations, classification, models and methods.","volume":"112","author":"H.Bouly","year":"2005","journal-title":"European Journal of Operational Research"},{"key":"jamc.2013040102-3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.02.012"},{"key":"jamc.2013040102-4","doi-asserted-by":"crossref","unstructured":"Carrera, S., Portmann, M. C., & Ramdane Cherif, W. (2010). Scheduling supply chain node with fixed components arrivals and two partially flexible deliveries. In Proceedings of the 5th International Conference on Management and Control of Production and Logistics.","DOI":"10.3182\/20100908-3-PT-3007.00030"},{"key":"jamc.2013040102-5","doi-asserted-by":"crossref","unstructured":"Chang, P. C., Chen, S. H., & Lin, K. L. (2005). Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Systems with Applications, 29, 705-712. ISSN: 0957-4174.","DOI":"10.1016\/j.eswa.2005.04.033"},{"key":"jamc.2013040102-6","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-008-1617-z"},{"key":"jamc.2013040102-7","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-007-1221-7"},{"key":"jamc.2013040102-8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"jamc.2013040102-9","first-page":"232","article-title":"A hybridized genetic algorithm to solve parallel machine scheduling problems with sequence dependent setups.","volume":"10","author":"J. W.Fowler","year":"2003","journal-title":"International Journal of Industrial Engineering: Theory Applications and Practice"},{"key":"jamc.2013040102-10","unstructured":"Gafarov, E. R., & Lazarev, A. A. (2010). Single machine scheduling with a non-renewable financial resource. Working paper."},{"key":"jamc.2013040102-11","author":"M. R.Garey","year":"1979","journal-title":"Computers and intractability a guide of the theory of NP- completeness"},{"key":"jamc.2013040102-12","doi-asserted-by":"publisher","DOI":"10.1080\/09537280150203951"},{"key":"jamc.2013040102-13","author":"J. H.Holland","year":"1975","journal-title":"Adaptation in natural and artificial systems: An introductory analysis with applications to biology: Control and artificial intelligence"},{"key":"jamc.2013040102-14","unstructured":"Janiak, A., Potts, C. N., & Tautenhahn, T. (2000). Single machine scheduling with nonlinear resource dependencies of release times. In Proceedings of the 14th Workshop on Discrete Optimization, Holzhau,Germany."},{"key":"jamc.2013040102-15","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00103-5"},{"key":"jamc.2013040102-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2009.01.003"},{"key":"jamc.2013040102-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"jamc.2013040102-18","doi-asserted-by":"crossref","unstructured":"Li, K., Shi, Y., Shan-lin, Y., & Ba-yi, C. (2011). Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Applied Software Computing, 5551-5557.","DOI":"10.1016\/j.asoc.2011.05.005"},{"key":"jamc.2013040102-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2008.10.014"},{"key":"jamc.2013040102-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2003.10.008"},{"key":"jamc.2013040102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2004.12.005"},{"key":"jamc.2013040102-22","doi-asserted-by":"publisher","DOI":"10.1016\/S0954-1810(99)00021-7"},{"key":"jamc.2013040102-23","doi-asserted-by":"publisher","DOI":"10.1080\/09537280110069649"},{"key":"jamc.2013040102-24","doi-asserted-by":"publisher","DOI":"10.1016\/S0954-1810(99)00021-7"},{"key":"jamc.2013040102-25","first-page":"193","article-title":"Parallel machine scheduling problems: A survey.","volume":"18","author":"E.Mokotoff","year":"2001","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"jamc.2013040102-26","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00090-2"},{"key":"jamc.2013040102-27","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.4.320"},{"key":"jamc.2013040102-28","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90105-X"},{"key":"jamc.2013040102-29","first-page":"145","article-title":"Real time rescheduling metaheuristic algorithms applied to FMS with routing flexibility. International Journal of Advanced Manufacturing Technology","volume":"64","author":"M.Souier","year":"2013","journal-title":"Springer Editor"},{"issue":"9","key":"jamc.2013040102-30","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1057\/jors.1991.152","article-title":"Scheduling under a non-renewable resource constraint.","volume":"42","author":"A.Toker","year":"1991","journal-title":"The Journal of the Operational Research Society"},{"key":"jamc.2013040102-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2004.07.002"},{"key":"jamc.2013040102-32","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(97)00007-2"},{"key":"jamc.2013040102-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.145"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=77636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T13:18:05Z","timestamp":1654089485000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jamc.2013040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,4,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jamc.2013040102","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,1]]}}}