{"id":"https://openalex.org/W2071456112","doi":"https://doi.org/10.1080/713804977","title":"Negotiation-based multi-stage production control using distributed shortest path algorithm","display_name":"Negotiation-based multi-stage production control using distributed shortest path algorithm","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2071456112","doi":"https://doi.org/10.1080/713804977","mag":"2071456112"},"language":"en","primary_location":{"id":"doi:10.1080/713804977","is_oa":false,"landing_page_url":"https://doi.org/10.1080/713804977","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","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/A5044906607","display_name":"Kung\u2010Jeng Wang","orcid":"https://orcid.org/0000-0002-5404-5023"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kung-Jeng Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044906607"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8031,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.92522132,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"1","first_page":"38","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9975000023841858,"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.9975000023841858,"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/T11182","display_name":"Auction Theory and Applications","score":0.979200005531311,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.9696000218391418,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/negotiation","display_name":"Negotiation","score":0.7598415017127991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7168082594871521},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5867258906364441},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5454148054122925},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5408594608306885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5363157391548157},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5302174687385559},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.48772820830345154},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48371177911758423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14858362078666687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1419588029384613},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11896106600761414},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07831558585166931}],"concepts":[{"id":"https://openalex.org/C199776023","wikidata":"https://www.wikidata.org/wiki/Q202875","display_name":"Negotiation","level":2,"score":0.7598415017127991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7168082594871521},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5867258906364441},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5454148054122925},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5408594608306885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5363157391548157},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5302174687385559},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.48772820830345154},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48371177911758423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14858362078666687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1419588029384613},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11896106600761414},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07831558585166931},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/713804977","is_oa":false,"landing_page_url":"https://doi.org/10.1080/713804977","pdf_url":null,"source":{"id":"https://openalex.org/S57062392","display_name":"International Journal of Computer Integrated Manufacturing","issn_l":"0951-192X","issn":["0951-192X","1362-3052"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Integrated Manufacturing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1919125783","https://openalex.org/W2119250154","https://openalex.org/W1500064003","https://openalex.org/W1596201972","https://openalex.org/W2064946650","https://openalex.org/W1970871823","https://openalex.org/W2391412785","https://openalex.org/W2347429605","https://openalex.org/W2134492883","https://openalex.org/W2388813193"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"a":[3,78,84,98,113,119,144],"fully":[4,67],"distributed":[5,68,114],"negotiation-based":[6],"model":[7,106,149],"for":[8,72,88,97,150],"optimally":[9],"allocating":[10],"jobs":[11,30],"to":[12,43,64,131,139],"be":[13],"processed":[14],"through":[15],"multiple":[16],"machines":[17,33,82,153],"and":[18,31,66,83,86],"alternative":[19,32,101,152],"routings":[20,102],"so":[21],"that":[22,133],"the":[23,44,54,90,110,125,129,134],"sojourn":[24,95],"time":[25,76],"is":[26,51,107,154],"minimized":[27],"as":[28],"confirmed":[29],"are":[34,103],"considered.":[35],"In":[36],"this":[37],"paper,":[38],"we":[39],"restrict":[40],"our":[41],"discussion":[42],"case":[45],"in":[46,53,77,143],"which":[47],"only":[48],"one":[49],"negotiation":[50,121],"active":[52],"shop":[55],"floor":[56],"at":[57],"any":[58],"time.":[59,146],"We":[60,123],"explore":[61],"issues":[62],"pertaining":[63],"dynamic":[65],"decision":[69],"making":[70],"(i)":[71],"deciding":[73],"job":[74,99],"completion":[75],"cooperative":[79],"manner":[80],"between":[81],"job,":[85],"(ii)":[87],"choosing":[89],"best":[91],"routing":[92],"(having":[93],"minimum":[94],"time)":[96],"when":[100],"available.":[104],"The":[105],"developed":[108],"on":[109],"basis":[111],"of":[112,128],"shortest":[115],"path":[116],"algorithm":[117],"using":[118],"job-initiated":[120],"protocol.":[122],"prove":[124],"convergence":[126],"property":[127],"protocol":[130],"guarantee":[132],"system":[135],"agents":[136],"can":[137],"converge":[138],"an":[140],"optimal":[141],"solution":[142],"finite":[145],"An":[147],"aggregated":[148],"tackling":[151],"also":[155],"developed.":[156]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}