{"id":"https://openalex.org/W2038123002","doi":"https://doi.org/10.1109/nabic.2012.6402236","title":"Multi-apprentice learning for meta-heuristics parameter tuning in a Multi Agent Scheduling System","display_name":"Multi-apprentice learning for meta-heuristics parameter tuning in a Multi Agent Scheduling System","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2038123002","doi":"https://doi.org/10.1109/nabic.2012.6402236","mag":"2038123002"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2012.6402236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2012.6402236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5022827069","display_name":"Ivo Pereira","orcid":"https://orcid.org/0000-0001-5440-3225"},"institutions":[{"id":"https://openalex.org/I83863532","display_name":"Polytechnic Institute of Porto","ror":"https://ror.org/04988re48","country_code":"PT","type":"education","lineage":["https://openalex.org/I83863532"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Ivo Pereira","raw_affiliation_strings":["GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering \u2013 Polytechnic of Porto, Porto, Portugal","GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering - Polytechnic of Porto, Porto, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering \u2013 Polytechnic of Porto, Porto, Portugal","institution_ids":["https://openalex.org/I83863532"]},{"raw_affiliation_string":"GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering - Polytechnic of Porto, Porto, Portugal","institution_ids":["https://openalex.org/I83863532"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088547215","display_name":"Ana Madureira","orcid":"https://orcid.org/0000-0002-0264-4710"},"institutions":[{"id":"https://openalex.org/I83863532","display_name":"Polytechnic Institute of Porto","ror":"https://ror.org/04988re48","country_code":"PT","type":"education","lineage":["https://openalex.org/I83863532"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Ana Madureira","raw_affiliation_strings":["GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering \u2013 Polytechnic of Porto, Porto, Portugal","GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering - Polytechnic of Porto, Porto, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering \u2013 Polytechnic of Porto, Porto, Portugal","institution_ids":["https://openalex.org/I83863532"]},{"raw_affiliation_string":"GECAD - Knowledge Engineering and Decision Support Group, Institute of Engineering - Polytechnic of Porto, Porto, Portugal","institution_ids":["https://openalex.org/I83863532"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004386406","display_name":"Paulo Moura Oliveira","orcid":"https://orcid.org/0000-0003-4283-1243"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]},{"id":"https://openalex.org/I4210166615","display_name":"INESC TEC","ror":"https://ror.org/05fa8ka61","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I4210125590","https://openalex.org/I4210166615"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Paulo de Moura Oliveira","raw_affiliation_strings":["INESC TEC - INESC Technology and Science (formely INESC Porto), University of Tr\u00e1s-os-Montes e Alto Douro, Vila Real, Portugal","INESC TEC - INESC Technology and Science (formely INESC Porto), Department of Engineering, University of Tr\u00e1s-os-Montes e Alto Douro, Vila Real, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"INESC TEC - INESC Technology and Science (formely INESC Porto), University of Tr\u00e1s-os-Montes e Alto Douro, Vila Real, Portugal","institution_ids":["https://openalex.org/I121345201","https://openalex.org/I4210166615"]},{"raw_affiliation_string":"INESC TEC - INESC Technology and Science (formely INESC Porto), Department of Engineering, University of Tr\u00e1s-os-Montes e Alto Douro, Vila Real, Portugal","institution_ids":["https://openalex.org/I121345201","https://openalex.org/I4210166615"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7589,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.68135743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":null,"first_page":"31","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9976999759674072,"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/heuristics","display_name":"Heuristics","score":0.7513684034347534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7404090166091919},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5778225064277649},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5472407937049866},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5329281687736511},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45189806818962097},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4266199469566345},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3344438076019287},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2072886824607849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14914017915725708}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7513684034347534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7404090166091919},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5778225064277649},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5472407937049866},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5329281687736511},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45189806818962097},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4266199469566345},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3344438076019287},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2072886824607849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14914017915725708},{"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/nabic.2012.6402236","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2012.6402236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","raw_type":"proceedings-article"},{"id":"pmh:oai:recipp.ipp.pt:10400.22/1556","is_oa":false,"landing_page_url":"http://hdl.handle.net/10400.22/1556","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference object"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1525136198","https://openalex.org/W1964637142","https://openalex.org/W2004617458","https://openalex.org/W2024060531","https://openalex.org/W2026161499","https://openalex.org/W2039568841","https://openalex.org/W2056760934","https://openalex.org/W2071306171","https://openalex.org/W2084792706","https://openalex.org/W2088304441","https://openalex.org/W2089852799","https://openalex.org/W2126385963","https://openalex.org/W2145079270","https://openalex.org/W2152195021","https://openalex.org/W2154061444","https://openalex.org/W3023540311","https://openalex.org/W3036035835","https://openalex.org/W4246565613","https://openalex.org/W6678591960","https://openalex.org/W6779748562"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"The":[0],"scheduling":[1],"problem":[2,55],"is":[3,35,46,64],"considered":[4],"in":[5,20,48,56,66],"complexity":[6],"theory":[7],"as":[8],"a":[9,36,57],"NP-hard":[10],"combinatorial":[11],"optimization":[12],"problem.":[13],"Meta-heuristics":[14],"proved":[15],"to":[16,40,50,68],"be":[17],"very":[18,37],"useful":[19],"the":[21,52,70],"resolution":[22],"of":[23,26],"this":[24],"class":[25],"problems.":[27],"However,":[28],"these":[29],"techniques":[30],"require":[31],"parameter":[32,53],"tuning":[33,54],"which":[34],"hard":[38],"task":[39],"perform.":[41],"A":[42,61],"Case-based":[43],"Reasoning":[44],"module":[45,73],"proposed":[47,71],"order":[49,67],"solve":[51],"Multi-Agent":[58],"Scheduling":[59],"System.":[60],"computational":[62],"study":[63],"performed":[65],"evaluate":[69],"CBR":[72],"performance.":[74]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}