{"id":"https://openalex.org/W2012996011","doi":"https://doi.org/10.1145/1839379.1839419","title":"Solving project scheduling problems by maximum cut computation","display_name":"Solving project scheduling problems by maximum cut computation","publication_year":2010,"publication_date":"2010-06-17","ids":{"openalex":"https://openalex.org/W2012996011","doi":"https://doi.org/10.1145/1839379.1839419","mag":"2012996011"},"language":"en","primary_location":{"id":"doi:10.1145/1839379.1839419","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1839379.1839419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies","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/A5040997317","display_name":"Zsolt Csuka","orcid":null},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Zsolt Csuka","raw_affiliation_strings":["Budapest University of Technology"],"affiliations":[{"raw_affiliation_string":"Budapest University of Technology","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040997317"],"corresponding_institution_ids":["https://openalex.org/I29770179"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.14292875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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/T11006","display_name":"BIM and Construction Integration","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.7227296233177185},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.7139832973480225},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6899492144584656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6491986513137817},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6050823330879211},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5821491479873657},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5818953514099121},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5643538236618042},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5301006436347961},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.45401233434677124},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4224832355976105},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.42056310176849365},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34432607889175415},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16344401240348816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14525192975997925}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7227296233177185},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.7139832973480225},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6899492144584656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6491986513137817},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6050823330879211},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5821491479873657},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5818953514099121},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5643538236618042},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5301006436347961},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.45401233434677124},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4224832355976105},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.42056310176849365},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34432607889175415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16344401240348816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14525192975997925},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1839379.1839419","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1839379.1839419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W178659373","https://openalex.org/W1547497998","https://openalex.org/W1992710140"],"related_works":["https://openalex.org/W2026959567","https://openalex.org/W2363460986","https://openalex.org/W2726385788","https://openalex.org/W1992918053","https://openalex.org/W4232808679","https://openalex.org/W4401880303","https://openalex.org/W2344568271","https://openalex.org/W2127524685","https://openalex.org/W4392305427","https://openalex.org/W1992854725"],"abstract_inverted_index":{"This":[0],"paper":[1,28],"deals":[2],"with":[3],"methods":[4],"for":[5,35],"solving":[6],"resource-constrained":[7],"project-scheduling":[8],"problems.":[9],"Among":[10],"the":[11,21,25,37,42,51,60,85],"project":[12],"activities":[13],"there":[14],"can":[15],"be":[16],"resource":[17,44],"conflicts":[18,45,62],"due":[19],"to":[20],"finite":[22],"capacity":[23],"of":[24,50],"resources.":[26],"The":[27,48,75],"aims":[29],"at":[30],"describing":[31],"a":[32,72],"new":[33,76],"method":[34,77],"minimizing":[36],"expected":[38],"makespan":[39],"while":[40],"all":[41,59],"possible":[43,61],"get":[46],"eliminated.":[47],"novelty":[49],"algorithm":[52],"is":[53],"that":[54],"it":[55],"does":[56],"not":[57],"enumerate":[58],"in":[63,71],"advance":[64],"but":[65],"only":[66],"those":[67],"which":[68],"may":[69],"occur":[70],"partial":[73],"schedule.":[74],"has":[78],"been":[79],"evaluated":[80],"using":[81],"benchmark":[82],"problems":[83],"from":[84],"literature.":[86]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}