{"id":"https://openalex.org/W3117798243","doi":"https://doi.org/10.1051/ro/2020144","title":"Hierarchical minimization of two maximum costs on a bounded serial-batching machine","display_name":"Hierarchical minimization of two maximum costs on a bounded serial-batching machine","publication_year":2020,"publication_date":"2020-12-20","ids":{"openalex":"https://openalex.org/W3117798243","doi":"https://doi.org/10.1051/ro/2020144","mag":"3117798243"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2020144","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020144","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/02/ro180286.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"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":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/02/ro180286.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100330330","display_name":"Cheng He","orcid":"https://orcid.org/0000-0003-4218-8454"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Cheng He","raw_affiliation_strings":["School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076627606","display_name":"Hao Lin","orcid":"https://orcid.org/0000-0003-2027-4036"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Lin","raw_affiliation_strings":["School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100360961","display_name":"Li Li","orcid":"https://orcid.org/0000-0001-5097-9972"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li Li","raw_affiliation_strings":["School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Science, Henan University of Technology, Zhengzhou, Henan 450001, P.R. China","institution_ids":["https://openalex.org/I36152291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100330330"],"corresponding_institution_ids":["https://openalex.org/I36152291"],"apc_list":null,"apc_paid":null,"fwci":0.1803,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62815667,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"55","issue":"1","first_page":"135","last_page":"140"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9945999979972839,"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/bounded-function","display_name":"Bounded function","score":0.709668755531311},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6245035529136658},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6217111349105835},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6102679371833801},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5826329588890076},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5380655527114868},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.4950958788394928},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4942965507507324},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4687749445438385},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.41400134563446045},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4123753309249878},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.353210985660553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3416775166988373},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06737923622131348}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.709668755531311},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6245035529136658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6217111349105835},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6102679371833801},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5826329588890076},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5380655527114868},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.4950958788394928},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4942965507507324},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4687749445438385},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41400134563446045},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4123753309249878},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353210985660553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3416775166988373},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06737923622131348},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro/2020144","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020144","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/02/ro180286.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"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/2020144","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.rairo-ro.org/10.1051/ro/2020144/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/2020144","raw_type":"Text"},{"id":"pmh:oai:numdam.org:RO_2021__55_1_135_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2020144/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"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":"Text"}],"best_oa_location":{"id":"doi:10.1051/ro/2020144","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2020144","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2021/02/ro180286.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G5167091242","display_name":null,"funder_award_id":"No. 1","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3117798243.pdf","grobid_xml":"https://content.openalex.org/works/W3117798243.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W227303143","https://openalex.org/W1488422606","https://openalex.org/W1971129425","https://openalex.org/W1975918625","https://openalex.org/W2003983870","https://openalex.org/W2005936117","https://openalex.org/W2078058343","https://openalex.org/W2106898833","https://openalex.org/W2767153625","https://openalex.org/W2794569776","https://openalex.org/W4254292280"],"related_works":["https://openalex.org/W1974309933","https://openalex.org/W4206466499","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W2390625990","https://openalex.org/W1956651153","https://openalex.org/W2347561926","https://openalex.org/W1984267569","https://openalex.org/W210339300"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,12,24,50,60,65,80,97,101],"hierarchical":[4,25,130],"optimization":[5,26,131],"problem":[6,31],"of":[7,32,79,87,91],"scheduling":[8],"n":[9,117,124,149,152],"jobs":[10,58,63,92],"on":[11],"serial-batching":[13,47],"machine,":[14],"in":[15,59,64,93],"which":[16],"two":[17,138],"objective":[18,139],"functions":[19,140],"are":[20,141],"maximum":[21,142],"costs.":[22],"By":[23],"problem,":[27],"we":[28,144],"mean":[29],"the":[30,34,38,41,72,76,85,88,94,111,134],"optimizing":[33],"secondary":[35],"criterion":[36,43],"under":[37],"constraint":[39],"that":[40,52],"primary":[42],"is":[44,49,82],"optimized.":[45],"A":[46],"machine":[48,51],"can":[53],"handle":[54],"up":[55],"to":[56,84,110],"b":[57,115],"batch":[61,66,81,99],"and":[62,68,75],"start":[67],"complete":[69],"respectively":[70],"at":[71],"same":[73],"time":[74,78,104],"processing":[77,89],"equal":[83],"sum":[86],"times":[90],"batch.":[95],"When":[96],"new":[98],"starts,":[100],"constant":[102],"setup":[103],"s":[105],"occurs.":[106],"We":[107,119],"confine":[108],"ourselves":[109],"bounded":[112],"model,":[113],"where":[114,137],"<":[116],".":[118],"present":[120],"an":[121,146],"O":[122,147],"(":[123,148],"4":[125],")-time":[126,153],"algorithm":[127],"for":[128],"this":[129],"problem.":[132],"For":[133],"special":[135],"case":[136],"lateness,":[143],"give":[145],"3":[150],"log":[151],"algorithm.":[154]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}