{"id":"https://openalex.org/W2771387133","doi":"https://doi.org/10.1109/smc.2017.8122662","title":"Meta-heuristic algorithms for scheduling on parallel batch machines with unequal job ready times","display_name":"Meta-heuristic algorithms for scheduling on parallel batch machines with unequal job ready times","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2771387133","doi":"https://doi.org/10.1109/smc.2017.8122662","mag":"2771387133"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2017.8122662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","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/A5053252990","display_name":"Michele B. Fidelis","orcid":null},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Michele B. Fidelis","raw_affiliation_strings":["Department of Computer Science, Universidade Federal de Vicosa, Vicosa, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal de Vicosa, Vicosa, MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048750231","display_name":"Jos\u00e9 Elias Claudio Arroyo","orcid":"https://orcid.org/0000-0003-3403-4770"},"institutions":[{"id":"https://openalex.org/I146165071","display_name":"Universidade Federal de Vi\u00e7osa","ror":"https://ror.org/0409dgb37","country_code":"BR","type":"education","lineage":["https://openalex.org/I146165071"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jose Elias C. Arroyo","raw_affiliation_strings":["Department of Computer Science, Universidade Federal de Vicosa, Vicosa, MG, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Universidade Federal de Vicosa, Vicosa, MG, Brazil","institution_ids":["https://openalex.org/I146165071"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146165071"],"apc_list":null,"apc_paid":null,"fwci":0.4363,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59327549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"32","issue":null,"first_page":"542","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9975000023841858,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9843999743461609,"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/tardiness","display_name":"Tardiness","score":0.8775614500045776},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7441153526306152},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.6776061058044434},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6335643529891968},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6121792197227478},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5499066710472107},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5278838872909546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4976816475391388},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46156802773475647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4571118652820587},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.4460394084453583},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41305121779441833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18619072437286377},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12476411461830139},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08699837327003479}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8775614500045776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7441153526306152},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.6776061058044434},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6335643529891968},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6121792197227478},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5499066710472107},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5278838872909546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4976816475391388},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46156802773475647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4571118652820587},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.4460394084453583},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41305121779441833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18619072437286377},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12476411461830139},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08699837327003479},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2017.8122662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2017.8122662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6100000143051147}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1973092446","https://openalex.org/W1977133017","https://openalex.org/W1978931881","https://openalex.org/W1989677008","https://openalex.org/W1990529873","https://openalex.org/W1997948597","https://openalex.org/W2003452693","https://openalex.org/W2005123733","https://openalex.org/W2006751452","https://openalex.org/W2019682901","https://openalex.org/W2024060531","https://openalex.org/W2056916950","https://openalex.org/W2091363003","https://openalex.org/W2092097317","https://openalex.org/W2117987000","https://openalex.org/W2122967269","https://openalex.org/W2159711221","https://openalex.org/W2472354136","https://openalex.org/W2571074416","https://openalex.org/W3022584652","https://openalex.org/W3139792597","https://openalex.org/W4255654664"],"related_works":["https://openalex.org/W2390625990","https://openalex.org/W1989333249","https://openalex.org/W2141859883","https://openalex.org/W4318996523","https://openalex.org/W2370573562","https://openalex.org/W2155531307","https://openalex.org/W2553665557","https://openalex.org/W2061287273","https://openalex.org/W2382048228","https://openalex.org/W2354949433"],"abstract_inverted_index":{"This":[0],"paper":[1],"address":[2],"the":[3,31,55,66,71,78,84,87,91,127,134,147],"problem":[4],"of":[5,9,22,44,62,110,124],"scheduling":[6],"a":[7,20,45,50,63,121],"set":[8,21],"jobs":[10,43,85],"with":[11],"non-zero":[12],"ready":[13,73,80],"times":[14],"and":[15,70,103,115],"incompatible":[16],"job":[17],"families":[18],"on":[19,99,120],"identical":[23],"parallel":[24],"batch":[25,51,72],"machines":[26],"so":[27],"as":[28,49,52,54],"to":[29,77,141],"minimize":[30],"total":[32],"weighted":[33],"tardiness.":[34],"In":[35],"this":[36],"problem,":[37,92],"each":[38],"machine":[39,56],"can":[40],"process":[41],"several":[42],"same":[46,67,148],"family":[47,64],"simultaneously":[48],"long":[53],"capacity":[57],"is":[58,75,113],"not":[59],"exceeded.":[60],"Jobs":[61],"has":[65,137],"processing":[68],"time":[69,74,81],"equal":[76],"largest":[79],"among":[82],"all":[83],"in":[86],"batch.":[88],"To":[89],"solve":[90],"we":[93],"propose":[94],"two":[95,142],"meta-heuristic":[96,143],"algorithms":[97,112,136,144],"based":[98],"Iterated":[100],"Greedy":[101],"(IG)":[102],"Simulated":[104],"Annealing":[105],"(SA),":[106],"respectively.":[107],"The":[108,129],"performance":[109,139],"our":[111],"evaluated":[114],"compared":[116,140],"by":[117],"computational":[118],"experiments":[119],"large":[122],"benchmark":[123],"instances":[125],"from":[126],"literature.":[128],"obtained":[130],"results":[131],"indicate":[132],"that":[133],"proposed":[135,145],"good":[138],"for":[146],"problem.":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}