{"id":"https://openalex.org/W4362700001","doi":"https://doi.org/10.1051/ro/2023050","title":"Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection","display_name":"Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection","publication_year":2023,"publication_date":"2023-04-07","ids":{"openalex":"https://openalex.org/W4362700001","doi":"https://doi.org/10.1051/ro/2023050"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2023050","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2023050","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1051/ro/2023050","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077353441","display_name":"Saeed Afkhami","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Saeed Afkhami","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070321332","display_name":"Ali Husseinzadeh Kashan","orcid":"https://orcid.org/0000-0002-6004-6882"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Husseinzadeh Kashan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5009936700","display_name":"Bakhtiar Ostadi","orcid":"https://orcid.org/0000-0001-8472-6244"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bakhtiar Ostadi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077353441"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6219,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72573791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"57","issue":"3","first_page":"1453","last_page":"1479"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9944999814033508,"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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7179515361785889},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6826549172401428},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6688979864120483},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6072244644165039},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.5618621706962585},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5546577572822571},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5451369881629944},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5029579997062683},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39914244413375854},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15499064326286316}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7179515361785889},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6826549172401428},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6688979864120483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6072244644165039},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.5618621706962585},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5546577572822571},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5451369881629944},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5029579997062683},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39914244413375854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15499064326286316},{"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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2023050","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2023050","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:edpsciences.org:dkey/10.1051/ro/2023050","is_oa":true,"landing_page_url":"https://www.rairo-ro.org/10.1051/ro/2023050/pdf","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/forth/ro210377.pdf","source":{"id":"https://openalex.org/S4306400744","display_name":"Springer Link (Chiba Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I8488066","host_organization_name":"Chiba Institute of Technology","host_organization_lineage":["https://openalex.org/I8488066"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://doi.org/10.1051/ro/2023050","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1051/ro/2023050","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2023050","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1964152549","https://openalex.org/W1965327483","https://openalex.org/W1966523365","https://openalex.org/W1971800895","https://openalex.org/W1975436849","https://openalex.org/W1975615434","https://openalex.org/W1976447371","https://openalex.org/W1978018515","https://openalex.org/W1980058421","https://openalex.org/W1995204653","https://openalex.org/W2005640849","https://openalex.org/W2006306047","https://openalex.org/W2012228660","https://openalex.org/W2012296215","https://openalex.org/W2014406129","https://openalex.org/W2019855372","https://openalex.org/W2023606494","https://openalex.org/W2032302696","https://openalex.org/W2047239908","https://openalex.org/W2048631059","https://openalex.org/W2051925582","https://openalex.org/W2087096734","https://openalex.org/W2095264582","https://openalex.org/W2163902342","https://openalex.org/W2168079536","https://openalex.org/W2193919580","https://openalex.org/W2345044602","https://openalex.org/W2742980432","https://openalex.org/W2767198269","https://openalex.org/W2903686439","https://openalex.org/W2910807099","https://openalex.org/W2945166602","https://openalex.org/W3006392833","https://openalex.org/W3035140752","https://openalex.org/W4234569973"],"related_works":["https://openalex.org/W2390625990","https://openalex.org/W2092966558","https://openalex.org/W2088387432","https://openalex.org/W1956651153","https://openalex.org/W2315766899","https://openalex.org/W2327547880","https://openalex.org/W2099326033","https://openalex.org/W2347561926","https://openalex.org/W1984267569","https://openalex.org/W210339300"],"abstract_inverted_index":{"We":[0,90,102],"address":[1],"the":[2,19,47,73,78,84,87,92,118,122,126,144,148,153,158,161,168,192,195],"scheduling":[3],"problem":[4,94],"of":[5,8,43,77,86,121,147,152,160,167,194],"a":[6,13,27,37,44,64,96,113,130,179,185],"set":[7],"non-identical":[9],"size":[10],"jobs":[11,80],"on":[12,117,134],"single":[14],"batch-processing":[15],"machine":[16],"(SBPM)":[17],"wherein":[18],"scheduler":[20,60],"can":[21],"make":[22],"decision":[23],"whether":[24],"to":[25,33,62,111,157],"schedule":[26,34],"job":[28,49],"in":[29,52],"batches":[30],"or":[31,57],"not":[32],"it":[35],"with":[36,139,173],"job-dependent":[38],"penalty.":[39],"The":[40,59],"processing":[41,50],"time":[42,51],"batch":[45,54],"is":[46,72,171,182],"greatest":[48],"that":[53],"(parallel":[55],"batching":[56],"p-batching).":[58],"wants":[61],"minimize":[63],"given":[65],"objective":[66],"function":[67],"f":[68,71],",":[69],"where":[70],"total":[74],"rejection":[75],"penalties":[76],"rejected":[79],"(rejection":[81],"cost)":[82],"plus":[83],"makespan":[85],"scheduled":[88],"ones.":[89],"formulate":[91],"aforementioned":[93],"as":[95,184],"0\u20131":[97],"mixed":[98],"integer":[99],"programming":[100,108],"model.":[101],"also":[103],"apply":[104],"an":[105],"effective":[106],"dynamic":[107],"algorithm":[109,137,181],"(DPA)":[110],"calculate":[112],"lower":[114],"bound":[115],"(LB)":[116],"optimal":[119],"cost":[120],"problem.":[123,162],"To":[124],"tackle":[125],"problem,":[127],"we":[128],"propose":[129],"grouping":[131],"algorithm,":[132],"based":[133],"league":[135],"championship":[136],"(LCA),":[138],"new":[140],"updating":[141,150],"equations":[142,151],"maintaining":[143],"major":[145],"characteristics":[146],"original":[149],"LCA":[154,170],"and":[155],"well-suited":[156],"structure":[159],"For":[163,176],"small":[164],"problems,":[165],"performance":[166,193],"proposed":[169,196],"compared":[172],"GAMS/CPLEX":[174],"solver.":[175],"large-scale":[177],"instances,":[178],"genetic":[180],"adopted":[183],"basis":[186],"for":[187],"comparison.":[188],"Simulated":[189],"experiments":[190],"confirm":[191],"methods.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}