{"id":"https://openalex.org/W2999028057","doi":"https://doi.org/10.1145/3371676.3371690","title":"A Polynomial Time Algorithm for Scheduling on Processing Time Constraints","display_name":"A Polynomial Time Algorithm for Scheduling on Processing Time Constraints","publication_year":2019,"publication_date":"2019-11-15","ids":{"openalex":"https://openalex.org/W2999028057","doi":"https://doi.org/10.1145/3371676.3371690","mag":"2999028057"},"language":"en","primary_location":{"id":"doi:10.1145/3371676.3371690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371676.3371690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","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/A5084480832","display_name":"Xuerong Yue","orcid":null},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xuerong Yue","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003464809","display_name":"Jiji Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiji Gao","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100604104","display_name":"Zhibin Chen","orcid":"https://orcid.org/0000-0002-5425-6189"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhibin Chen","raw_affiliation_strings":["Department of Mathematics, Kunming University of Science and Technology, Kunming, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kunming University of Science and Technology, Kunming, China","institution_ids":["https://openalex.org/I10660446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084480832"],"corresponding_institution_ids":["https://openalex.org/I10660446"],"apc_list":null,"apc_paid":null,"fwci":0.4413,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73404325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"109","last_page":"113"},"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.9955999851226807,"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.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/time-complexity","display_name":"Time complexity","score":0.7300904989242554},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7192890644073486},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6471846103668213},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5873138308525085},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5303497910499573},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.45324814319610596},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.4398495554924011},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42316746711730957},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4141496419906616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4106558859348297},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3232075572013855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2642778754234314}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7300904989242554},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7192890644073486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6471846103668213},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5873138308525085},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5303497910499573},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.45324814319610596},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.4398495554924011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42316746711730957},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4141496419906616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4106558859348297},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3232075572013855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2642778754234314},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3371676.3371690","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3371676.3371690","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 9th International Conference on Communication and Network Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W55614575","https://openalex.org/W964861289","https://openalex.org/W1488422606","https://openalex.org/W1966527086","https://openalex.org/W1984027871","https://openalex.org/W2003327526","https://openalex.org/W2019133545","https://openalex.org/W2089269509","https://openalex.org/W2104680817","https://openalex.org/W2133097277","https://openalex.org/W2611804663","https://openalex.org/W2743045177","https://openalex.org/W2904754170","https://openalex.org/W4300550233"],"related_works":["https://openalex.org/W1581479499","https://openalex.org/W2024806294","https://openalex.org/W2095303169","https://openalex.org/W997954202","https://openalex.org/W4236295709","https://openalex.org/W2530969325","https://openalex.org/W2520902986","https://openalex.org/W4229049727","https://openalex.org/W2886143600","https://openalex.org/W2588704993"],"abstract_inverted_index":{"Given":[0],"m":[1,31],"parallel":[2],"machines":[3,32],"and":[4],"n":[5],"jobs":[6,29],"with":[7],"each":[8],"job":[9],"having":[10],"a":[11,17,24,78],"processing":[12,57,70,95],"time,":[13],"the":[14,35,65,69,92],"classical":[15],"scheduling,":[16],"famous":[18],"NP-hard":[19],"problem,":[20],"wants":[21],"to":[22,26,91],"find":[23],"way":[25],"schedule":[27],"all":[28],"on":[30,56,64],"such":[33],"that":[34,81],"makespan":[36],"is":[37],"minimized.":[38],"In":[39],"this":[40,48,83],"paper,":[41],"we":[42],"consider":[43],"polynomial":[44],"time":[45],"solvability":[46],"of":[47,74],"problem":[49],"in":[50,67],"some":[51],"cases":[52],"when":[53,94],"certain":[54],"conditions":[55],"times":[58,71,96],"are":[59,72],"being":[60],"imposed.":[61],"We":[62,76],"focus":[63],"case":[66,93],"which":[68],"powers":[73],"2.":[75],"design":[77],"polynomial-time":[79],"algorithm":[80],"solves":[82],"special":[84],"case.":[85],"Our":[86],"result":[87],"can":[88],"be":[89],"generalized":[90],"satisfy":[97],"divisible":[98],"property.":[99]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}