{"id":"https://openalex.org/W2163609084","doi":"https://doi.org/10.4304/jsw.4.5.487-494","title":"Intelligent Job Shop Scheduling Based on MAS and Integrated Routing Wasp Algorithm and Scheduling Wasp Algorithm","display_name":"Intelligent Job Shop Scheduling Based on MAS and Integrated Routing Wasp Algorithm and Scheduling Wasp Algorithm","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2163609084","doi":"https://doi.org/10.4304/jsw.4.5.487-494","mag":"2163609084"},"language":"en","primary_location":{"id":"doi:10.4304/jsw.4.5.487-494","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.4.5.487-494","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","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/A5081826882","display_name":"Yan Cao","orcid":"https://orcid.org/0000-0003-4638-7717"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yan Cao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030659829","display_name":"Yanli Yang","orcid":"https://orcid.org/0000-0003-1919-8857"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yanli Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101758548","display_name":"Huamin Wang","orcid":"https://orcid.org/0000-0002-8153-2337"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huamin Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022815251","display_name":"Lina Yang","orcid":"https://orcid.org/0000-0002-1742-9941"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lina Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7407,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79529559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9926999807357788,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9552000164985657,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8043330907821655},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6309247612953186},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5906311869621277},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.577358067035675},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5764171481132507},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5447758436203003},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5224267840385437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5136591792106628},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5028023719787598},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.46423450112342834},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4548419713973999},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4120227098464966},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3101527988910675},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.0980580747127533},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09311401844024658},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06625315546989441}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8043330907821655},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6309247612953186},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5906311869621277},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.577358067035675},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5764171481132507},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5447758436203003},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5224267840385437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5136591792106628},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5028023719787598},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.46423450112342834},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4548419713973999},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4120227098464966},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3101527988910675},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0980580747127533},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09311401844024658},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06625315546989441},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4304/jsw.4.5.487-494","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.4.5.487-494","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.498.6567","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.498.6567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.academypublisher.com/jsw/vol04/no05/jsw0405487494.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1976109100","https://openalex.org/W1978386360","https://openalex.org/W2077266984","https://openalex.org/W2081779975","https://openalex.org/W2142344913","https://openalex.org/W2167741587","https://openalex.org/W2354270002","https://openalex.org/W2359301452"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2741059494","https://openalex.org/W131757205","https://openalex.org/W2057737420","https://openalex.org/W2596081411","https://openalex.org/W3041148412","https://openalex.org/W4304187649","https://openalex.org/W2134269501","https://openalex.org/W2895871327","https://openalex.org/W4244749153"],"abstract_inverted_index":{"Abstract\u2014Dynamic":[0],"scheduling":[1,35,103,124,135,148,194],"algorithms":[2,95,138,151,178],"are":[3,71,96,127,139,152,163,168],"gaining":[4],"more":[5,7],"and":[6,48,82,122,158,165,186],"special":[8],"attention":[9],"for":[10,31],"their":[11,22,181,201],"satisfying":[12],"robustness":[13],"when":[14],"confronted":[15],"with":[16,195],"unexpected":[17],"events":[18],"as":[19,21,87],"well":[20],"considerably":[23],"high":[24],"performance":[25],"in":[26,67],"scheduling.":[27],"An":[28],"organization":[29],"structure":[30,55],"intelligent":[32],"job":[33,100,132,145],"shop":[34,101,133,146,206],"based":[36,154],"on":[37,106,155],"MAS":[38],"(Multiple":[39],"Agents":[40],"System)":[41],"is":[42,56,179,184],"put":[43,57],"forward":[44,58],"to":[45,59,98,129,141,144,191,200],"achieve":[46],"effective":[47],"efficient":[49],"production.":[50],"A":[51],"hybrid":[52],"multi-layer":[53],"agent":[54],"facilitate":[60],"constructing":[61],"various":[62],"agents.":[63],"Consequently,":[64],"all":[65],"resources":[66],"a":[68,88],"manufacturing":[69,76],"system":[70],"reorganized":[72],"into":[73],"an":[74],"agile":[75],"network":[77],"of":[78,80,91,109,176],"agents":[79],"autonomous":[81],"cooperative":[83],"characteristics.":[84],"Regarding":[85],"wasps":[86],"specific":[89],"kind":[90],"agents,":[92],"wasp":[93,111,120,125,211],"colony":[94,112,212],"used":[97],"solve":[99,130],"dynamic":[102,134,147,193,208],"problem.":[104,136],"Based":[105],"the":[107,110,118,123,131,174,177],"principle":[108,175],"algorithm,":[113,126,213],"two":[114],"different":[115],"algorithms,":[116],"namely":[117],"routing":[119],"algorithm":[121],"combined":[128],"The":[137,150,170],"modified":[140],"better":[142],"adapt":[143],"environment.":[149],"developed":[153],"Eclipse":[156],"3.2":[157],"J2SE":[159,215],"6.0.":[160],"Simulation":[161],"experiments":[162],"accomplished":[164],"experimental":[166],"data":[167],"analyzed.":[169],"results":[171],"show":[172],"that":[173],"simple,":[180],"computational":[182],"quantity":[183],"small,":[185],"they":[187],"can":[188],"be":[189],"applied":[190],"multi-batch":[192],"unpredictable":[196],"entry":[197],"time":[198],"due":[199],"favorable":[202],"potential.":[203],"Index":[204],"Terms\u2014job":[205],"scheduling,":[207,209],"MAS,":[210],"Eclipse,":[214],"I.":[216]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}