{"id":"https://openalex.org/W1975970216","doi":"https://doi.org/10.1057/palgrave.jors.2602448","title":"Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework","display_name":"Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework","publication_year":2007,"publication_date":"2007-07-18","ids":{"openalex":"https://openalex.org/W1975970216","doi":"https://doi.org/10.1057/palgrave.jors.2602448","mag":"1975970216"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2602448","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602448","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070321332","display_name":"Ali Husseinzadeh Kashan","orcid":"https://orcid.org/0000-0002-6004-6882"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A H Kashan","raw_affiliation_strings":["Amirkabir University of Technology Tehran Iran","Amirkabir University of Technology, Tehran, IRAN"],"affiliations":[{"raw_affiliation_string":"Amirkabir University of Technology Tehran Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"Amirkabir University of Technology, Tehran, IRAN","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014666798","display_name":"Behrooz Karimi","orcid":"https://orcid.org/0000-0003-3556-8643"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"B Karimi","raw_affiliation_strings":["Amirkabir University of Technology Tehran Iran","Amirkabir University of Technology, Tehran, IRAN"],"affiliations":[{"raw_affiliation_string":"Amirkabir University of Technology Tehran Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"Amirkabir University of Technology, Tehran, IRAN","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014666798"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":null,"apc_paid":null,"fwci":4.86135256,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.93725943,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"59","issue":"9","first_page":"1269","last_page":"1280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7840744256973267},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7547644376754761},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.675804078578949},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6615291833877563},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5786511898040771},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5773434042930603},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.5737852454185486},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5652347803115845},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5167707204818726},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4525664150714874},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4183276891708374},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2739664912223816},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.17247867584228516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13447922468185425}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7840744256973267},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7547644376754761},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.675804078578949},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6615291833877563},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5786511898040771},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5773434042930603},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.5737852454185486},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5652347803115845},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5167707204818726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4525664150714874},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4183276891708374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2739664912223816},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.17247867584228516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13447922468185425},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2602448","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602448","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:59:y:2008:i:9:d:10.1057_palgrave.jors.2602448","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2602448","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1557288165","https://openalex.org/W1748133846","https://openalex.org/W1965327483","https://openalex.org/W2014406129","https://openalex.org/W2017896057","https://openalex.org/W2021261368","https://openalex.org/W2034279788","https://openalex.org/W2044439396","https://openalex.org/W2048631059","https://openalex.org/W2069703649","https://openalex.org/W2074055219","https://openalex.org/W2074693286","https://openalex.org/W2082642933","https://openalex.org/W2092068825","https://openalex.org/W2105821629","https://openalex.org/W2107941094","https://openalex.org/W2111001493","https://openalex.org/W2114338779","https://openalex.org/W2136186989","https://openalex.org/W2137903142","https://openalex.org/W2148948822","https://openalex.org/W2160271133","https://openalex.org/W2168079536"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2462483068"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"investigates":[3],"the":[4,8,14,29,42,91,107,111,116,138,153,157,166,173],"first":[5],"attempt":[6],"on":[7,70,125,140],"batch-processing":[9,35],"machine":[10,15,36],"scheduling":[11,30],"problem,":[12],"where":[13],"can":[16],"process":[17],"multiple":[18],"jobs":[19],"simultaneously,":[20],"using":[21,126],"an":[22,57,79],"ant":[23,80],"colony":[24,81],"optimization":[25],"metaheuristic.":[26],"We":[27],"consider":[28],"problem":[31,148,174],"of":[32,45,52,73,93,118,129,144,156],"a":[33,53,71,127,141],"single":[34],"with":[37],"incompatible":[38],"job":[39],"families":[40],"and":[41,61,67,110,133,160],"performance":[43,117,155],"measure":[44],"minimizing":[46],"total":[47],"weighted":[48],"completion":[49],"time.":[50],"Jobs":[51],"given":[54],"family":[55],"have":[56],"identical":[58],"processing":[59],"time":[60],"are":[62,88,122],"characterized":[63],"by":[64,90],"arbitrary":[65],"sizes":[66],"weights.":[68],"Based":[69],"number":[72],"developed":[74],"heuristic":[75,95,132],"approaches,":[76],"we":[77],"propose":[78],"framework":[82,159],"(ACF)":[83],"in":[84,102,169],"two":[85,103],"versions,":[86],"which":[87],"distinguished":[89],"type":[92],"embedded":[94],"information.":[96],"Each":[97],"version":[98],"is":[99,106],"also":[100],"investigated":[101],"formats,":[104],"that":[105],"pure":[108],"ACF":[109],"hybridized":[112],"ACF.":[113],"To":[114],"verify":[115],"our":[119],"framework,":[120],"comparisons":[121],"made":[123],"based":[124],"set":[128,143],"well-known":[130],"existing":[131],"meta-heuristic":[134],"algorithms":[135,168],"taken":[136],"from":[137],"literature,":[139],"diverse":[142],"artificially":[145],"generated":[146],"test":[147],"instances.":[149],"Computational":[150],"results":[151],"show":[152],"high":[154],"proposed":[158],"signify":[161],"its":[162],"ability":[163],"to":[164],"outperform":[165],"comparator":[167],"most":[170],"cases":[171],"as":[172],"size":[175],"increases.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}