{"id":"https://openalex.org/W2092989314","doi":"https://doi.org/10.1142/s0129626412500065","title":"THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING","display_name":"THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING","publication_year":2012,"publication_date":"2012-05-14","ids":{"openalex":"https://openalex.org/W2092989314","doi":"https://doi.org/10.1142/s0129626412500065","mag":"2092989314"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626412500065","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626412500065","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5054694650","display_name":"Fukuhito Ooshita","orcid":"https://orcid.org/0000-0001-9400-1095"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"FUKUHITO OOSHITA","raw_affiliation_strings":["Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan","Graduate School of Information Science and Technology, Osaka University, 1-5, Yamadaoka, Suita, Osaka, 565-0871, Japan#TAB#"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]},{"raw_affiliation_string":"Graduate School of Information Science and Technology, Osaka University, 1-5, Yamadaoka, Suita, Osaka, 565-0871, Japan#TAB#","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101584743","display_name":"Tomoko Izumi","orcid":"https://orcid.org/0009-0003-8948-1401"},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]},{"id":"https://openalex.org/I135768898","display_name":"Ritsumeikan University","ror":"https://ror.org/0197nmd03","country_code":"JP","type":"education","lineage":["https://openalex.org/I135768898","https://openalex.org/I4390039241"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TOMOKO IZUMI","raw_affiliation_strings":["College of Information Science and Engineering, Ritsumeikan University, 1-1-1 Noji higashi, Kusatsu, Shiga 525-8577, Japan","Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-tyo, Syowa-ku, Nagoya, Aichi 466-8555, Japan"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Ritsumeikan University, 1-1-1 Noji higashi, Kusatsu, Shiga 525-8577, Japan","institution_ids":["https://openalex.org/I135768898"]},{"raw_affiliation_string":"Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-tyo, Syowa-ku, Nagoya, Aichi 466-8555, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101050681","display_name":"Taisuke Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I135768898","display_name":"Ritsumeikan University","ror":"https://ror.org/0197nmd03","country_code":"JP","type":"education","lineage":["https://openalex.org/I135768898","https://openalex.org/I4390039241"]},{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TAISUKE IZUMI","raw_affiliation_strings":["College of Information Science and Engineering, Ritsumeikan University, 1-1-1 Noji higashi, Kusatsu, Shiga 525-8577, Japan","Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-tyo, Syowa-ku, Nagoya, Aichi 466-8555, Japan"],"affiliations":[{"raw_affiliation_string":"College of Information Science and Engineering, Ritsumeikan University, 1-1-1 Noji higashi, Kusatsu, Shiga 525-8577, Japan","institution_ids":["https://openalex.org/I135768898"]},{"raw_affiliation_string":"Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-tyo, Syowa-ku, Nagoya, Aichi 466-8555, Japan","institution_ids":["https://openalex.org/I197274945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054694650"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21641428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"22","issue":"02","first_page":"1250006","last_page":"1250006"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.9994000196456909,"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/T11182","display_name":"Auction Theory and Applications","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8773322701454163},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5988339781761169},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5842630863189697},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5296670794487},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.516839325428009},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.453583300113678},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4519656300544739},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4195745587348938},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4104440212249756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2909281551837921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22501158714294434}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8773322701454163},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5988339781761169},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5842630863189697},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5296670794487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.516839325428009},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.453583300113678},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4519656300544739},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4195745587348938},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4104440212249756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2909281551837921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22501158714294434},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626412500065","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626412500065","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4399999976158142,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1512811285","https://openalex.org/W2005845593","https://openalex.org/W2011039300","https://openalex.org/W2012634103","https://openalex.org/W2052586468","https://openalex.org/W2070943541","https://openalex.org/W2077048046","https://openalex.org/W2097025565","https://openalex.org/W2102201348","https://openalex.org/W2111714984","https://openalex.org/W2151792026","https://openalex.org/W2153937695","https://openalex.org/W3121217993","https://openalex.org/W4234582748","https://openalex.org/W4237121211"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1966261337","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,122,170,188],"consider":[1],"the":[2,25,32,49,53,67,73,76,85,100,112,115,118,125,130,141,160,166,178,191,224],"parallel":[3],"computing":[4],"environment":[5],"where":[6,59,102],"m":[7,134],"organizations":[8,20],"provide":[9],"machines":[10],"and":[11,40,117,175],"several":[12],"jobs":[13,38,91,104],"to":[14,23,92,203],"be":[15,93],"executed.":[16],"While":[17],"cooperation":[18,158],"of":[19,35,69,88,97,120,168,193,216],"is":[21,43,63,144,211],"required":[22],"minimize":[24],"global":[26],"makespan,":[27],"each":[28,80],"organization":[29,81],"also":[30,189],"expects":[31],"faster":[33],"completion":[34,86],"its":[36,89,172],"own":[37,90],"primarily":[39],"thus":[41],"it":[42],"not":[44,83],"necessarily":[45],"cooperative.":[46],"To":[47],"handle":[48],"situations,":[50],"we":[51,110,164],"formulate":[52],"\u03b1-cooperative":[54],"multi-organization":[55,77,126,201],"scheduling":[56],"problem":[57],"(\u03b1-MOSP),":[58],"\u03b1":[60,95,137,151],"\u2265":[61],"1":[62],"a":[64,212,217],"parameter":[65],"representing":[66],"degree":[68,119],"cooperativeness.":[70,121],"\u03b1-MOSP":[71],"minimizes":[72],"makespan":[74,116,132,161],"under":[75,199],"constraint":[78,127,202],"that":[79,98,124,156,222],"does":[82],"allow":[84],"time":[87],"delayed":[94],"times":[96,135],"in":[99],"case":[101],"those":[103],"are":[105],"executed":[106],"by":[107,133,146],"itself.":[108],"First,":[109],"reveal":[111],"relation":[113],"between":[114],"show":[123,171,190],"may":[128],"degrade":[129],"optimal":[131,197,205],"for":[136,150,177,207,214],"=":[138],"1,":[139],"while":[140],"degradation":[142],"ratio":[143],"bounded":[145],"\u03b1/(\u03b1":[147],"-":[148],"1)":[149],">":[152],"1.":[153],"This":[154,209],"implies":[155],"weak":[157],"improves":[159],"dramatically.":[162],"Second,":[163],"study":[165],"complexity":[167],"\u03b1-MOSP.":[169,208],"strongly":[173],"NP-hardness":[174],"inapproximability":[176],"approximation":[179,225],"factor":[180],"less":[181],"than":[182],"max":[183],"{(\u03b1":[184],"+":[185],"1)/\u03b1,":[186],"3/2}.":[187],"hardness":[192],"transformation":[194,220],"from":[195],"an":[196,204],"schedule":[198,206],"no":[200],"result":[210],"witness":[213],"inexistence":[215],"general":[218],"polynomial-time":[219],"algorithm":[221],"preserves":[223],"ratio.":[226]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}