{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:58:00Z","timestamp":1768550280738,"version":"3.49.0"},"reference-count":30,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T00:00:00Z","timestamp":1623110400000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,4,17]]},"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:p>This paper considers the minimization of makespan in the unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic job ready time. The considered unrelated machines have different capacity and different processing speed. Each machine processes a number of the jobs as a batch at the same time so that the machine\u2019s capacity is not exceeded. The batch processing time and the batch ready time are equal to the largest processing time and the largest ready time of jobs in the same batch, respectively. In this paper, a Mixed Integer Linear Programming (MILP) model, two categories of the heuristic procedures (six heuristics) and a meta-heuristic algorithm are proposed to solve the problem. A lower bound is also presented by relaxing of the original problem to evaluate the quality of the proposed algorithms. The computational experiments show the performance of the proposed algorithms under the considered measures.<\/jats:p>","DOI":"10.1051\/ro\/2021062","type":"journal-article","created":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T19:01:45Z","timestamp":1618858905000},"page":"1501-1522","source":"Crossref","is-referenced-by-count":12,"title":["Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times"],"prefix":"10.1051","volume":"55","author":[{"given":"Yaser","family":"Zarook","sequence":"first","affiliation":[]},{"given":"Javad","family":"Rezaeian","sequence":"additional","affiliation":[]},{"given":"Iraj","family":"Mahdavi","sequence":"additional","affiliation":[]},{"given":"Masoud","family":"Yaghini","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2021,6,8]]},"reference":[{"key":"R1","unstructured":"Baker R., Principles of Sequencing and Scheduling. Wiley, New Jersey (1943)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"Bean","year":"1994","journal-title":"ORSA J. Comput."},{"key":"R3","doi-asserted-by":"crossref","first-page":"4211","DOI":"10.1080\/00207540410001711863","volume":"42","author":"Chang","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1007\/s00170-007-1042-8","volume":"37","author":"Damodaran","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R5","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.ijpe.2006.02.010","volume":"103","author":"Damodaran","year":"2006","journal-title":"Int. J. Prod. Econ."},{"key":"R6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1504\/EJIE.2009.023605","volume":"3","author":"Damodaran","year":"2009","journal-title":"Eur. J. Ind. Eng."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1016\/j.cor.2012.12.012","volume":"40","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"R8","unstructured":"Holland J., Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)."},{"key":"R9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","volume":"78","author":"Jos\u00e9 Elias","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.engappai.2018.10.012","volume":"77","author":"Jos\u00e9 Elias","year":"2019","journal-title":"Eng. App. Artif. Intell."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.cor.2006.07.005","volume":"35","author":"Kashan","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"R12","doi-asserted-by":"crossref","first-page":"4091","DOI":"10.1080\/00207540410001704041","volume":"42","author":"Koh","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"R13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ijpe.2004.10.001","volume":"98","author":"Koh","year":"2005","journal-title":"Int. J. Prod. Econ."},{"key":"R14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1016\/j.asoc.2017.10.028","volume":"68","author":"Lars","year":"2018","journal-title":"Appl. Soft Comput. J."},{"key":"R15","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"Lee","year":"1992","journal-title":"Oper. Res."},{"key":"R16","doi-asserted-by":"crossref","first-page":"3016","DOI":"10.1016\/j.cor.2005.11.011","volume":"34","author":"Malvea","year":"2007","journal-title":"Computers & Operations Research"},{"key":"R17","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","volume":"29","author":"Mathirajan","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","volume":"87","author":"Melouk","year":"2004","journal-title":"Int. J. Prod. Econ."},{"key":"R19","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"Monch","year":"2011","journal-title":"J. Scheduling"},{"key":"R20","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.ejor.2020.01.065","volume":"285","author":"Muter","year":"2020","journal-title":"Eur. J. Oper. Res."},{"key":"R21","unstructured":"Pinedo M.L., Scheduling Theory, Algorithms, and Systems, 3rd edition. Springer, New York (2008)."},{"key":"R22","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.cor.2011.05.011","volume":"39","author":"Rui","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"630","DOI":"10.1016\/j.asoc.2016.10.008","volume":"52","author":"Shengchao","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"R24","unstructured":"Taguchi G., Introduction to Quality Engineering. Asian Productivity Organization\/UNIPUB White Plains (1986)."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"Uzsoy","year":"1994","journal-title":"Int. J. Prod. Res."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Xu S. and Bean J.C., A genetic algorithm for scheduling parallel non-identical batch processing machines. In: . IEEE Symposium on Computational Intelligence in Scheduling (2007) 143\u2013150.","DOI":"10.1109\/SCIS.2007.367682"},{"key":"R27","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2013.04.053","volume":"145","author":"Xu","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"R28","doi-asserted-by":"crossref","first-page":"1879","DOI":"10.1007\/s00170-014-6342-1","volume":"76","author":"Zarook","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"R29","doi-asserted-by":"crossref","first-page":"977","DOI":"10.3934\/jimo.2016057","volume":"13","author":"Zhao-Hong","year":"2017","journal-title":"J. Ind. Manage. Optim."},{"key":"R30","doi-asserted-by":"crossref","first-page":"118420","DOI":"10.1016\/j.energy.2020.118420","volume":"209","author":"Zhou","year":"2020","journal-title":"Energy"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021062\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,24]],"date-time":"2022-12-24T18:42:16Z","timestamp":1671907336000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":30,"journal-issue":{"issue":"3"},"alternative-id":["ro200191"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021062","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}