{"id":"https://openalex.org/W4312198670","doi":"https://doi.org/10.1109/ieem55944.2022.9989797","title":"Batch Scheduling and Robust Batch Scheduling to Minimize Maximum Lateness","display_name":"Batch Scheduling and Robust Batch Scheduling to Minimize Maximum Lateness","publication_year":2022,"publication_date":"2022-12-07","ids":{"openalex":"https://openalex.org/W4312198670","doi":"https://doi.org/10.1109/ieem55944.2022.9989797"},"language":"en","primary_location":{"id":"doi:10.1109/ieem55944.2022.9989797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem55944.2022.9989797","pdf_url":null,"source":{"id":"https://openalex.org/S4363607849","display_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-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/A5048869829","display_name":"K. Miyagawa","orcid":null},"institutions":[{"id":"https://openalex.org/I1298590031","display_name":"Shizuoka University","ror":"https://ror.org/01w6wtk13","country_code":"JP","type":"education","lineage":["https://openalex.org/I1298590031"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"K. Miyagawa","raw_affiliation_strings":["Shizuoka University,Hamamatsu,Japan","Shizuoka University, Hamamatsu, Japan"],"affiliations":[{"raw_affiliation_string":"Shizuoka University,Hamamatsu,Japan","institution_ids":["https://openalex.org/I1298590031"]},{"raw_affiliation_string":"Shizuoka University, Hamamatsu, Japan","institution_ids":["https://openalex.org/I1298590031"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044066892","display_name":"K. Hasegawa","orcid":"https://orcid.org/0000-0001-8174-0614"},"institutions":[{"id":"https://openalex.org/I1298590031","display_name":"Shizuoka University","ror":"https://ror.org/01w6wtk13","country_code":"JP","type":"education","lineage":["https://openalex.org/I1298590031"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K. Hasegawa","raw_affiliation_strings":["Shizuoka University,Hamamatsu,Japan","Shizuoka University, Hamamatsu, Japan"],"affiliations":[{"raw_affiliation_string":"Shizuoka University,Hamamatsu,Japan","institution_ids":["https://openalex.org/I1298590031"]},{"raw_affiliation_string":"Shizuoka University, Hamamatsu, Japan","institution_ids":["https://openalex.org/I1298590031"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023697287","display_name":"Liang Tang","orcid":"https://orcid.org/0000-0002-5988-8660"},"institutions":[{"id":"https://openalex.org/I43313876","display_name":"Dalian Maritime University","ror":"https://ror.org/002b7nr53","country_code":"CN","type":"education","lineage":["https://openalex.org/I43313876"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"L. Tang","raw_affiliation_strings":["Dailian Maritime University,Dailian,China","Dailian Maritime University, Dailian, China"],"affiliations":[{"raw_affiliation_string":"Dailian Maritime University,Dailian,China","institution_ids":["https://openalex.org/I43313876"]},{"raw_affiliation_string":"Dailian Maritime University, Dailian, China","institution_ids":["https://openalex.org/I43313876"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062074756","display_name":"Wei Wu","orcid":"https://orcid.org/0000-0002-0443-3642"},"institutions":[{"id":"https://openalex.org/I1298590031","display_name":"Shizuoka University","ror":"https://ror.org/01w6wtk13","country_code":"JP","type":"education","lineage":["https://openalex.org/I1298590031"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"W. Wu","raw_affiliation_strings":["Shizuoka University,Hamamatsu,Japan","Shizuoka University, Hamamatsu, Japan"],"affiliations":[{"raw_affiliation_string":"Shizuoka University,Hamamatsu,Japan","institution_ids":["https://openalex.org/I1298590031"]},{"raw_affiliation_string":"Shizuoka University, Hamamatsu, Japan","institution_ids":["https://openalex.org/I1298590031"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5048869829"],"corresponding_institution_ids":["https://openalex.org/I1298590031"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21085378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"0706","last_page":"0710"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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":0.9998000264167786,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9912999868392944,"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/computer-science","display_name":"Computer science","score":0.6987468004226685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6626110076904297},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6246522665023804},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.6187167763710022},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.5971832871437073},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5511780977249146},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5435802936553955},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4971306622028351},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3640329837799072},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22597211599349976},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.17238888144493103}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6987468004226685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6626110076904297},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6246522665023804},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.6187167763710022},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.5971832871437073},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5511780977249146},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5435802936553955},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4971306622028351},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3640329837799072},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22597211599349976},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.17238888144493103},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieem55944.2022.9989797","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem55944.2022.9989797","pdf_url":null,"source":{"id":"https://openalex.org/S4363607849","display_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1971129425","https://openalex.org/W2118578357","https://openalex.org/W2136186989","https://openalex.org/W2142465614","https://openalex.org/W4298007174"],"related_works":["https://openalex.org/W2390625990","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2092966558","https://openalex.org/W1956651153","https://openalex.org/W2139982839","https://openalex.org/W2347561926","https://openalex.org/W1984267569","https://openalex.org/W210339300","https://openalex.org/W2014733634"],"abstract_inverted_index":{"We":[0,28,41],"consider":[1],"the":[2,31,35,71,86,98,103,107,125,132],"problem":[3],"of":[4],"scheduling":[5,39,83,89,110],"jobs":[6],"on":[7,124],"a":[8,44,58,63,114],"batching":[9],"machine":[10],"to":[11,47,69],"minimize":[12],"maximum":[13],"lateness.":[14],"Two":[15],"batch":[16,20,24],"processing":[17,53],"modes,":[18],"serial":[19],"(s-batch)":[21],"and":[22,37,80,121],"parallel":[23],"(p-batch),":[25],"are":[26,55],"considered.":[27],"first":[29],"describe":[30],"exact":[32,94],"algorithms":[33,68],"for":[34,77],"s-batch":[36,79,87],"p-batch":[38,81,108],"problems.":[40,84],"then":[42],"present":[43],"robust":[45,82,88,109],"extension":[46],"classical":[48,104],"problems":[49],"in":[50],"which":[51],"uncertain":[52],"times":[54],"represented":[56],"by":[57],"budgeted":[59],"uncertainty":[60],"set.":[61],"Given":[62],"solution,":[64],"we":[65,91,112],"demonstrate":[66],"efficient":[67],"evaluate":[70],"solution":[72],"under":[73],"its":[74],"worst-case":[75],"scenario":[76],"both":[78,119],"For":[85,106],"problem,":[90,111],"propose":[92],"an":[93],"algorithm":[95,116],"that":[96,117,131],"has":[97],"same":[99],"time":[100],"complexity":[101],"as":[102],"problem.":[105],"design":[113],"heuristic":[115,134],"provides":[118],"upper":[120],"lower":[122],"bounds":[123],"optimal":[126],"value.":[127],"Computational":[128],"results":[129],"show":[130],"proposed":[133],"performs":[135],"satisfactorily.":[136]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}