{"id":"https://openalex.org/W1573642915","doi":"https://doi.org/10.1007/3-540-63138-0_14","title":"A parallel approximation algorithm for resource constrained scheduling and bin packing","display_name":"A parallel approximation algorithm for resource constrained scheduling and bin packing","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1573642915","doi":"https://doi.org/10.1007/3-540-63138-0_14","mag":"1573642915"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-63138-0_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63138-0_14","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":"book-chapter","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/A5108463602","display_name":"Anand Srivastav","orcid":null},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anand Srivastav","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","Humboldt Universit\u00e1t zu Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Humboldt Universit\u00e1t zu Berlin","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017535875","display_name":"Peter Stangier","orcid":null},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Stangier","raw_affiliation_strings":["Zentrum f\u00fcr Paralleles Rechnen (ZPR), Universit\u00e4t zu K\u00f6ln, Weyertal 80, 50931, K\u00f6ln, Germany",", Universit\u00e4t zu K\u00f6ln,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zentrum f\u00fcr Paralleles Rechnen (ZPR), Universit\u00e4t zu K\u00f6ln, Weyertal 80, 50931, K\u00f6ln, Germany","institution_ids":["https://openalex.org/I180923762"]},{"raw_affiliation_string":", Universit\u00e4t zu K\u00f6ln,","institution_ids":["https://openalex.org/I180923762"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.3811,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.93925234,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"147","last_page":"158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"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.9986000061035156,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8748447895050049},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.656021773815155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.651185929775238},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5857531428337097},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5311908721923828},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5146299600601196},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.49261337518692017},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47797080874443054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4672406017780304},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4409981667995453},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44087591767311096},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3682364225387573},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.35551440715789795},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3399502635002136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28627896308898926}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8748447895050049},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.656021773815155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.651185929775238},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5857531428337097},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5311908721923828},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5146299600601196},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.49261337518692017},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47797080874443054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4672406017780304},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4409981667995453},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44087591767311096},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3682364225387573},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.35551440715789795},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3399502635002136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28627896308898926},{"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.1007/3-540-63138-0_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63138-0_14","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1573642915","https://openalex.org/W1606480398","https://openalex.org/W1964089073","https://openalex.org/W1966815789","https://openalex.org/W2022191808","https://openalex.org/W2025787252","https://openalex.org/W2054094480","https://openalex.org/W2057128446","https://openalex.org/W2061496873","https://openalex.org/W2068871408","https://openalex.org/W2100440346","https://openalex.org/W2102669784","https://openalex.org/W2113142402","https://openalex.org/W2145028977","https://openalex.org/W2158219072","https://openalex.org/W2396715558","https://openalex.org/W2807988286","https://openalex.org/W2809548040","https://openalex.org/W2905110430","https://openalex.org/W3011766368","https://openalex.org/W4214625098","https://openalex.org/W4254887701","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W173368591","https://openalex.org/W2034272113","https://openalex.org/W2138242427","https://openalex.org/W4288260564","https://openalex.org/W4255148175","https://openalex.org/W2104955674","https://openalex.org/W2068892231","https://openalex.org/W2096053066"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}