{"id":"https://openalex.org/W4253774047","doi":"https://doi.org/10.1504/ijmheur.2016.10002048","title":"Bi-criteria parallel machine scheduling using nature-inspired hybrid flower pollination algorithm","display_name":"Bi-criteria parallel machine scheduling using nature-inspired hybrid flower pollination algorithm","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W4253774047","doi":"https://doi.org/10.1504/ijmheur.2016.10002048"},"language":"en","primary_location":{"id":"doi:10.1504/ijmheur.2016.10002048","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10002048","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","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/A5101845835","display_name":"Sameer Sharma","orcid":"https://orcid.org/0000-0002-7198-0371"},"institutions":[{"id":"https://openalex.org/I270449672","display_name":"Doaba College","ror":"https://ror.org/05batzg24","country_code":"IN","type":"education","lineage":["https://openalex.org/I270449672"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sameer Sharma","raw_affiliation_strings":["Department of Mathematics, D.A.V. College, Jalandhar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, D.A.V. College, Jalandhar, India","institution_ids":["https://openalex.org/I270449672"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105458850","display_name":"Renu Dhir","orcid":"https://orcid.org/0000-0003-1641-2619"},"institutions":[{"id":"https://openalex.org/I70971781","display_name":"Dr. B. R. Ambedkar National Institute of Technology Jalandhar","ror":"https://ror.org/03xt0bg88","country_code":"IN","type":"education","lineage":["https://openalex.org/I70971781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Renu Dhir","raw_affiliation_strings":["Department of Computer Science and Engineering, Dr B.R. Ambedkar National Institute of Technology, Jalandhar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Dr B.R. Ambedkar National Institute of Technology, Jalandhar, India","institution_ids":["https://openalex.org/I70971781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035683760","display_name":"Kawal Jeet","orcid":"https://orcid.org/0000-0002-2914-4660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kawal Jeet","raw_affiliation_strings":["Department of Computer Science, D.A.V. College, Jalandhar, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, D.A.V. College, Jalandhar, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.50612947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"3/4","first_page":"226","last_page":"226"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9661999940872192,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9660000205039978,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.8534224033355713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7544007897377014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6046301126480103},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5348160862922668},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5165814161300659},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.515751838684082},{"id":"https://openalex.org/keywords/pollination","display_name":"Pollination","score":0.4246372878551483},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4007003605365753},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.38034170866012573},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20512527227401733},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1719006896018982}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.8534224033355713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7544007897377014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6046301126480103},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5348160862922668},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5165814161300659},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.515751838684082},{"id":"https://openalex.org/C168197293","wikidata":"https://www.wikidata.org/wiki/Q134624","display_name":"Pollination","level":3,"score":0.4246372878551483},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4007003605365753},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.38034170866012573},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20512527227401733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1719006896018982},{"id":"https://openalex.org/C2780618852","wikidata":"https://www.wikidata.org/wiki/Q79932","display_name":"Pollen","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmheur.2016.10002048","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmheur.2016.10002048","pdf_url":null,"source":{"id":"https://openalex.org/S206578720","display_name":"International Journal of Metaheuristics","issn_l":"1755-2176","issn":["1755-2176","1755-2184"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Metaheuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2011810134","https://openalex.org/W2050497389","https://openalex.org/W1568976062","https://openalex.org/W2960025371","https://openalex.org/W2367625138","https://openalex.org/W2019537266","https://openalex.org/W2017891857","https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265"],"abstract_inverted_index":{"Parallel":[0],"machine":[1],"scheduling":[2,88],"and":[3,82,103,120,144],"its":[4],"complex":[5],"combinatorial":[6],"optimisation":[7,46],"problems":[8],"are":[9],"widely":[10],"studied.":[11],"A":[12],"lot":[13],"of":[14,31,53,62,87],"research":[15],"has":[16,108],"been":[17,80,109,139],"carried":[18,36],"out":[19,37],"in":[20,41,93,95],"this":[21,49],"area":[22],"to":[23,26,34,43,84,97,126,131],"determine":[24],"how":[25],"effectively":[27],"schedule":[28],"parallel":[29,94],"execution":[30],"different":[32,39],"jobs":[33,89],"be":[35],"using":[38,117],"machines":[40,91],"order":[42,96],"achieve":[44],"the":[45,51,60,85,132],"criteria.":[47],"In":[48],"paper,":[50],"formulations":[52],"multi-objective":[54,113],"flower":[55,114],"pollination":[56,115],"algorithm":[57,78,116,124],"obtained":[58,137],"by":[59,141],"combination":[61],"weighted":[63,104],"objectives":[64],"or":[65],"secondary":[66,118],"storage":[67,119],"for":[68],"managing":[69],"possible":[70],"solutions":[71],"along":[72],"with":[73,76,122],"their":[74],"hybrids":[75],"genetic":[77,123],"have":[79,138],"developed":[81],"applied":[83],"problem":[86],"on":[90],"running":[92],"optimise":[98],"bi-criteria,":[99],"namely,":[100],"maximum":[101],"tardiness":[102],"flow":[105],"time.":[106],"It":[107],"empirically":[110],"verified":[111,140],"that":[112],"hybridised":[121],"leads":[125],"better":[127],"results":[128,136],"as":[129],"compared":[130],"existing":[133],"algorithms.":[134],"The":[135],"numerical":[142],"illustrations":[143],"statistical":[145],"tests.":[146]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}