{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:07:23Z","timestamp":1769274443356,"version":"3.49.0"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"publisher","award":["71601001"],"award-info":[{"award-number":["71601001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation","doi-asserted-by":"publisher","award":["71671168"],"award-info":[{"award-number":["71671168"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanity and Social Science Youth Foundation of Ministry of Education of China","award":["15YJC630041"],"award-info":[{"award-number":["15YJC630041"]}]},{"DOI":"10.13039\/501100003995","name":"Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["1608085MG154"],"award-info":[{"award-number":["1608085MG154"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Anhui Provincial Education Department","award":["KJ2015A062"],"award-info":[{"award-number":["KJ2015A062"]}]},{"name":"Foundation of Co-Innovation Center for Information Supply and Assurance Technology of Anhui University","award":["ADXXBZ201509"],"award-info":[{"award-number":["ADXXBZ201509"]}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71471052"],"award-info":[{"award-number":["71471052"]}],"id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1016\/j.asoc.2017.01.044","type":"journal-article","created":{"date-parts":[[2017,2,3]],"date-time":"2017-02-03T12:05:45Z","timestamp":1486123545000},"page":"226-237","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":59,"special_numbering":"C","title":["Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines"],"prefix":"10.1016","volume":"55","author":[{"given":"Zhao-hong","family":"Jia","sequence":"first","affiliation":[]},{"given":"Yu-lan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Joseph Y.-T.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0005","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","article-title":"Efficient scheduling algorithms for a single batch processing machine","volume":"5","author":"Ikura","year":"1986","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.asoc.2017.01.044_bib0010","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.40.4.764","article-title":"Efficient algorithms for scheduling semiconductor burn-in operations","volume":"40","author":"Lee","year":"1992","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2017.01.044_bib0015","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.40.4.750","article-title":"Batching and scheduling jobs on batch and discrete processors","volume":"40","author":"Ahmadi","year":"1992","journal-title":"Oper. Res."},{"issue":"9\u201310","key":"10.1016\/j.asoc.2017.01.044_bib0020","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1007\/s00170-005-2585-1","article-title":"A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor","volume":"29","author":"Mathirajan","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"10.1016\/j.asoc.2017.01.044_bib0025","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1016\/j.rcim.2009.06.001","article-title":"Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm","volume":"25","author":"Luo","year":"2009","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"6","key":"10.1016\/j.asoc.2017.01.044_bib0030","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1080\/00207541003610262","article-title":"Hybrid flowshop scheduling with batch-discrete processors and machine maintenance in time windows","volume":"49","author":"Luo","year":"2011","journal-title":"Int. J. Prod. Res."},{"issue":"9","key":"10.1016\/j.asoc.2017.01.044_bib0035","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1080\/00207549308956847","article-title":"Minimizing total completion time on batch processing machines","volume":"31","author":"Chandru","year":"1993","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.asoc.2017.01.044_bib0040","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0925-5273(98)00067-X","article-title":"Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes","volume":"55","author":"Ghazvini","year":"1998","journal-title":"Int. J. Prod. Econ."},{"issue":"7","key":"10.1016\/j.asoc.2017.01.044_bib0045","doi-asserted-by":"crossref","first-page":"1615","DOI":"10.1080\/00207549408957026","article-title":"Scheduling a single batch processing machine with non-identical job sizes","volume":"32","author":"Uzsoy","year":"2007","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0050","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/j.1937-5956.1997.tb00415.x","article-title":"Minimizing total weighted completion time on a single batch processing machine","volume":"6","author":"Uzsoy","year":"2009","journal-title":"Prod. Oper. Manag."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0055","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-5273(03)00092-6","article-title":"Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing","volume":"87","author":"Melouk","year":"2004","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.asoc.2017.01.044_bib0060","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/s00170-005-0194-7","article-title":"A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem","volume":"31","author":"Chou","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"42","key":"10.1016\/j.asoc.2017.01.044_bib0065","doi-asserted-by":"crossref","first-page":"4091","DOI":"10.1080\/00207540410001704041","article-title":"Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families","volume":"42","author":"Koh","year":"2004","journal-title":"Int. J. Prod. Res."},{"issue":"19","key":"10.1016\/j.asoc.2017.01.044_bib0070","doi-asserted-by":"crossref","first-page":"4211","DOI":"10.1080\/00207540410001711863","article-title":"Minimizing makespan on parallel batch processing machines","volume":"42","author":"Chang","year":"2004","journal-title":"Int. J. Prod. Res."},{"issue":"9","key":"10.1016\/j.asoc.2017.01.044_bib0075","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1007\/s00170-007-1042-8","article-title":"Heuristics to minimize makespan of parallel batch processing machines","volume":"37","author":"Damodaran","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0080","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/002075499192020","article-title":"Minimizing makespan on a single batch processing machine with dynamic job arrivals","volume":"37","author":"Lee","year":"1999","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0085","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1504\/EJIE.2009.023605","article-title":"Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms","volume":"3","author":"Damodaran","year":"2009","journal-title":"Eur. J. Ind. Eng."},{"issue":"49","key":"10.1016\/j.asoc.2017.01.044_bib0090","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1007\/s00170-009-2457-1","article-title":"Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times","volume":"49","author":"Damodaran","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0095","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2004.11.004","article-title":"Minimizing makespan with release times on identical parallel batching machines","volume":"148","author":"Li","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"18","key":"10.1016\/j.asoc.2017.01.044_bib0100","doi-asserted-by":"crossref","first-page":"5109","DOI":"10.1080\/00207540802010807","article-title":"Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes","volume":"47","author":"Chung","year":"2009","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0105","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1016\/j.eswa.2009.06.070","article-title":"Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics","volume":"37","author":"Wang","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2017.01.044_bib0110","first-page":"1","article-title":"Local search algorithm with path relinking for single batch-processing machine scheduling problem","volume":"5","author":"Zhang","year":"2016","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.asoc.2017.01.044_bib0115","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.cor.2016.08.015","article-title":"Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times","volume":"78","author":"Arroyo","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.01.044_bib0120","series-title":"An Effective Hybrid Multi-Objective Genetic Algorithm for Bi-Criteria Scheduling on a Single Batch Processing Machine With Non-Identical Job Sizes","author":"Kashan","year":"1995"},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0125","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.ijpe.2013.04.053","article-title":"A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system","volume":"145","author":"Xu","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2017.01.044_bib0130","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.jclepro.2016.07.206","article-title":"Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration","volume":"137","author":"Wang","year":"2016","journal-title":"J. Clean. Prod."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0135","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/S0377-2217(99)00153-8","article-title":"Scheduling with batching: a review","volume":"120","author":"Potts","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2017.01.044_bib0140","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","article-title":"A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations","volume":"14","author":"M\u00f6nch","year":"2011","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0145","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","article-title":"Ant colonies for the travelling salesman problem","volume":"43","author":"Dorigo","year":"1997","journal-title":"Biosystems"},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0150","first-page":"25","article-title":"A new rank based version of the ant system\u2014a computational study","author":"Bullnheimer","year":"1999","journal-title":"Central Eur. J. Oper. Res."},{"issue":"8","key":"10.1016\/j.asoc.2017.01.044_bib0155","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"Max\u2013min ant system","volume":"16","author":"St\u00fctzle","year":"1999","journal-title":"Future Gen. Comput. Syst."},{"key":"10.1016\/j.asoc.2017.01.044_bib0160","series-title":"Ant Algorithms, Third International Workshop, ANTS 2002","first-page":"282","article-title":"Using genetic algorithms to optimize ACS-TSP","author":"Pilat","year":"2002"},{"issue":"9","key":"10.1016\/j.asoc.2017.01.044_bib0165","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1057\/palgrave.jors.2602448","article-title":"Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: an ant colony framework","volume":"59","author":"Kashan","year":"2008","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0170","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jmsy.2010.06.007","article-title":"Scheduling a single batch-processing machine with non-identical job sizes in fuzzy environment using an improved ant colony optimization","volume":"29","author":"Cheng","year":"2010","journal-title":"J. Manuf. Syst."},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0175","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.ijpe.2006.02.010","article-title":"Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms","volume":"103","author":"Damodaran","year":"2006","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"10.1016\/j.asoc.2017.01.044_bib0180","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.cor.2011.05.011","article-title":"Makespan minimization on single batch-processing machine via ant colony optimization","volume":"39","author":"Xu","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0185","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2015.02.017","article-title":"Integrated scheduling of production and distribution to minimize total cost using an improved ant colony optimization method","volume":"83","author":"Cheng","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2017.01.044_bib0190","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.asoc.2015.09.056","article-title":"An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families","volume":"38","author":"Jia","year":"2015","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.asoc.2017.01.044_bib0195","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.cie.2007.08.003","article-title":"Ant colony optimization for multi-objective flow shop scheduling problem","volume":"54","author":"Yagmahan","year":"2008","journal-title":"Comput. Ind. Eng."},{"issue":"9\u201310","key":"10.1016\/j.asoc.2017.01.044_bib0200","first-page":"985","article-title":"ACO-based multi-objective scheduling of parallel batch processing machines with advanced process control constraints","volume":"44","author":"Li","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2017.01.044_bib0205","series-title":"Preference Vector Ant Colony System for Minimising Makespan and Energy Consumption in a Hybrid Flow Shop","author":"Du","year":"2011"},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0210","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2017.01.044_bib0215","first-page":"95","article-title":"Spea2: improving the strength Pareto evolutionary algorithm","volume":"vol. 3242","author":"Zitzler","year":"2001"},{"issue":"2","key":"10.1016\/j.asoc.2017.01.044_bib0220","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of multiobjective evolutionary algorithms: empirical results","volume":"8","author":"Zitzler","year":"2000","journal-title":"Evol. Comput."},{"key":"10.1016\/j.asoc.2017.01.044_bib0225","series-title":"International Conference on Evolutionary Multi-Criterion Optimization","first-page":"519","article-title":"The measure of Pareto optima applications to multi-objective metaheuristics","author":"Fleischer","year":"2003"},{"issue":"1","key":"10.1016\/j.asoc.2017.01.044_bib0230","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/TEVC.2005.851274","article-title":"Parego: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems","volume":"10","author":"Knowles","year":"2006","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.asoc.2017.01.044_bib0235","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10845-009-0272-z","article-title":"A grasp approach for makespan minimization on parallel batch processing machines","volume":"22","author":"Damodaran","year":"2011","journal-title":"J. Intell. Manuf."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617300595?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617300595?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,7,14]],"date-time":"2022-07-14T05:30:15Z","timestamp":1657776615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494617300595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":47,"alternative-id":["S1568494617300595"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2017.01.044","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2017,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bi-criteria ant colony optimization algorithm for minimizing makespan and energy consumption on parallel batch machines","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2017.01.044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}