{"id":"https://openalex.org/W2121865860","doi":"https://doi.org/10.1007/3-540-48481-7_13","title":"Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems","display_name":"Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2121865860","doi":"https://doi.org/10.1007/3-540-48481-7_13","mag":"2121865860"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48481-7_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48481-7_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5001357515","display_name":"Rolf H. M\u00f6hring","orcid":"https://orcid.org/0000-0003-3766-8728"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf H. M\u00f6hring","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103095757","display_name":"Andreas S. Schulz","orcid":"https://orcid.org/0000-0002-9595-459X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas S. Schulz","raw_affiliation_strings":["MIT, Sloan School of Management and Operations Research Center, E53-361, 30Wadsworth St, Cambridge, MA, 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Sloan School of Management and Operations Research Center, E53-361, 30Wadsworth St, Cambridge, MA, 02139","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056687879","display_name":"Frederik Stork","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frederik Stork","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052226987","display_name":"Marc Uetz","orcid":"https://orcid.org/0000-0003-4223-2435"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc Uetz","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Fachbereich Mathematik, Sekr. MA 6-1, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.3771,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.97794928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998000264167786,"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.9998000264167786,"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.9958999752998352,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9235000014305115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7636849880218506},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6644131541252136},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5554439425468445},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5158052444458008},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5023360252380371},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.494973361492157},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.43135306239128113},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21793133020401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18457740545272827}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7636849880218506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6644131541252136},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5554439425468445},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5158052444458008},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5023360252380371},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.494973361492157},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.43135306239128113},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21793133020401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18457740545272827},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-48481-7_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48481-7_13","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/a85cd7a7-ff8e-4175-9a75-898fb614f431","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/a85cd7a7-ff8e-4175-9a75-898fb614f431","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"M\u00f6hring, R H, Schulz, A S, Stork, F & Uetz, M 1999, Resource-constrained project scheduling : computing lower bounds by solving minimum cut problems. in J Ne\u0161et\u0159il (ed.), Algorithms - ESA\u2019 99 : 7th Annual European Symposium Prague, Czech Republic, July 16\u201318, 1999 Proceedings. Lecture Notes in Computer Science, vol. 1643, Springer, Berlin, Heidelberg, pp. 139-150, 7th Annual European Symposium on Algorithms, ESA 1999, Prague, Czech Republic, 16/07/99. https://doi.org/10.1007/3-540-48481-7_13","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.46.2925","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.2925","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-berlin.de/~uetz/lncs-lblgr.ps.Z","raw_type":"text"},{"id":"pmh:oai:ris.utwente.nl:publications/a85cd7a7-ff8e-4175-9a75-898fb614f431","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W196088982","https://openalex.org/W1685122025","https://openalex.org/W1964701519","https://openalex.org/W1966465131","https://openalex.org/W1973131489","https://openalex.org/W1987733635","https://openalex.org/W2007087937","https://openalex.org/W2022076151","https://openalex.org/W2024237395","https://openalex.org/W2036112575","https://openalex.org/W2038345112","https://openalex.org/W2040296085","https://openalex.org/W2044889545","https://openalex.org/W2090359754","https://openalex.org/W2106622621","https://openalex.org/W2119881593","https://openalex.org/W2137370418","https://openalex.org/W2143474538","https://openalex.org/W2169586176","https://openalex.org/W2507072029","https://openalex.org/W2595284542","https://openalex.org/W3125921679","https://openalex.org/W4298173117","https://openalex.org/W4299866835","https://openalex.org/W6662456526","https://openalex.org/W6680812728","https://openalex.org/W7008297124"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2998357381","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3204654320"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}