{"id":"https://openalex.org/W4409708426","doi":"https://doi.org/10.1142/s0129054125460025","title":"Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance","display_name":"Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance","publication_year":2025,"publication_date":"2025-04-22","ids":{"openalex":"https://openalex.org/W4409708426","doi":"https://doi.org/10.1142/s0129054125460025"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054125460025","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125460025","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5100739542","display_name":"Jing Fan","orcid":"https://orcid.org/0000-0002-4644-7225"},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jing Fan","raw_affiliation_strings":["School of Mathematics, Physics and Statistics, Shanghai Polytechnic University, Shanghai 201209, P. R. China"],"raw_orcid":"https://orcid.org/0000-0002-4644-7225","affiliations":[{"raw_affiliation_string":"School of Mathematics, Physics and Statistics, Shanghai Polytechnic University, Shanghai 201209, P. R. China","institution_ids":["https://openalex.org/I135905480"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100739542"],"corresponding_institution_ids":["https://openalex.org/I135905480"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10478479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":"05","first_page":"827","last_page":"840"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9894999861717224,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9684000015258789,"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.6642166376113892},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6458116769790649},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5769677758216858},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5324130058288574},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3654186725616455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3235149383544922},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2597211003303528}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6642166376113892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6458116769790649},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5769677758216858},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5324130058288574},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3654186725616455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3235149383544922},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2597211003303528},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054125460025","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054125460025","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6297243611","display_name":null,"funder_award_id":"11601316","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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W179790402","https://openalex.org/W1489341683","https://openalex.org/W1942481402","https://openalex.org/W1965327483","https://openalex.org/W1978018515","https://openalex.org/W1980096819","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W2005202176","https://openalex.org/W2005640849","https://openalex.org/W2019692413","https://openalex.org/W2026949381","https://openalex.org/W2032494347","https://openalex.org/W2034279788","https://openalex.org/W2042109944","https://openalex.org/W2048631059","https://openalex.org/W2067937546","https://openalex.org/W2093851652","https://openalex.org/W2111001493","https://openalex.org/W2139982839","https://openalex.org/W2552618837","https://openalex.org/W2764174695","https://openalex.org/W2808241839","https://openalex.org/W2914170357","https://openalex.org/W2956475745","https://openalex.org/W3019910272","https://openalex.org/W3134021171","https://openalex.org/W3175546025","https://openalex.org/W4283162824","https://openalex.org/W4285125131"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"In":[0],"this":[1,89],"paper,":[2],"we":[3,116,138,154],"consider":[4],"the":[5,19,34,61,69,80,85,92,102,108,118,131,140,156],"scheduling":[6],"problem":[7,119,141],"on":[8],"a":[9,30,76,125,148,169],"single":[10],"bounded":[11],"parallel-batch":[12],"machine":[13,70],"with":[14],"flexible":[15],"maintenance,":[16],"in":[17,52,88],"which":[18],"time":[20,56,74,83],"gap":[21],"between":[22],"any":[23],"two":[24],"consecutive":[25],"maintenance":[26,36,104],"is":[27,37,79,95,99,120,142],"limited":[28],"by":[29],"given":[31],"constant":[32],"and":[33,91,123,146,165,167],"last":[35,103],"required":[38],"after":[39],"all":[40],"jobs":[41,47,66,86,111,134,160],"are":[42],"completed.":[43],"A":[44],"batch":[45,78,90],"of":[46,64,75,84],"can":[48],"be":[49],"processed":[50],"simultaneously":[51],"some":[53],"available":[54],"processing":[55,73,82,114,163],"interval":[57],"as":[58,60],"long":[59],"total":[62],"size":[63],"these":[65],"doesn\u2019t":[67],"exceed":[68],"capacity.":[71],"The":[72],"job":[77],"largest":[81],"contained":[87],"production":[93],"progress":[94],"non-resumable.":[96],"Our":[97],"objective":[98],"to":[100],"minimize":[101],"completion":[105],"time.":[106],"For":[107,130],"case":[109,132,158],"where":[110,133,159],"have":[112,135,161],"unit":[113,136],"times,":[115],"show":[117,139],"strongly":[121,144],"NP-hard":[122,145],"present":[124],"[Formula:":[126,149,170],"see":[127,150,171],"text]-approximation":[128,151,172],"algorithm.":[129,152,173],"sizes,":[137],"also":[143],"provide":[147],"Finally,":[153],"study":[155],"general":[157],"non-identical":[162],"times":[164],"sizes":[166],"propose":[168]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}