{"id":"https://openalex.org/W2900930400","doi":"https://doi.org/10.1007/978-3-030-04651-4_23","title":"Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments","display_name":"Makespan Minimization on Unrelated Parallel Machines with Simple Job-Intersection Structure and Bounded Job Assignments","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2900930400","doi":"https://doi.org/10.1007/978-3-030-04651-4_23","mag":"2900930400"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-04651-4_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_23","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/A5000014120","display_name":"Daniel R. Page","orcid":"https://orcid.org/0000-0002-6317-7431"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Daniel R. Page","raw_affiliation_strings":["Department of Computer Science, Western University, London, Canada"],"raw_orcid":"https://orcid.org/0000-0002-6317-7431","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Western University, London, Canada","institution_ids":["https://openalex.org/I125749732"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017900722","display_name":"Roberto Solis-Oba","orcid":"https://orcid.org/0000-0002-7518-4161"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Roberto Solis-Oba","raw_affiliation_strings":["Department of Computer Science, Western University, London, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Western University, London, Canada","institution_ids":["https://openalex.org/I125749732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069850579","display_name":"Marten Maack","orcid":"https://orcid.org/0000-0001-7918-6642"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marten Maack","raw_affiliation_strings":["Department of Computer Science, University of Kiel, Kiel, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kiel, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000014120"],"corresponding_institution_ids":["https://openalex.org/I125749732"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.1322,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82428722,"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":"341","last_page":"356"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9958000183105469,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9891999959945679,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7797985672950745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.721039354801178},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6440556645393372},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6134448647499084},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5996188521385193},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4864780604839325},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4586825668811798},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4535558819770813},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4368237853050232},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42686980962753296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4104498028755188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38968896865844727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27245065569877625},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.2563983201980591},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1749967336654663},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1430951952934265}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7797985672950745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.721039354801178},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6440556645393372},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6134448647499084},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5996188521385193},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4864780604839325},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4586825668811798},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4535558819770813},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4368237853050232},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42686980962753296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4104498028755188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38968896865844727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27245065569877625},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2563983201980591},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1749967336654663},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1430951952934265},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-04651-4_23","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-04651-4_23","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":[{"score":0.7300000190734863,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1579049696","https://openalex.org/W1899379166","https://openalex.org/W1967066104","https://openalex.org/W2000850616","https://openalex.org/W2019300924","https://openalex.org/W2029824311","https://openalex.org/W2051676433","https://openalex.org/W2052586468","https://openalex.org/W2066813640","https://openalex.org/W2079967097","https://openalex.org/W2081855231","https://openalex.org/W2102201348","https://openalex.org/W2119344260","https://openalex.org/W2138118431","https://openalex.org/W2150875823","https://openalex.org/W2242342996","https://openalex.org/W2265244619","https://openalex.org/W2412591217","https://openalex.org/W2541841001","https://openalex.org/W2581693535","https://openalex.org/W2952993429","https://openalex.org/W3152404636","https://openalex.org/W4205585032","https://openalex.org/W4214560154","https://openalex.org/W6606312767"],"related_works":["https://openalex.org/W4206466499","https://openalex.org/W2970302286","https://openalex.org/W4213379045","https://openalex.org/W2810352541","https://openalex.org/W3190401582","https://openalex.org/W2162001022","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W2120272254","https://openalex.org/W2964071505"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}