{"id":"https://openalex.org/W2022297072","doi":"https://doi.org/10.1080/00207160701331376","title":"A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness","display_name":"A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness","publication_year":2007,"publication_date":"2007-11-22","ids":{"openalex":"https://openalex.org/W2022297072","doi":"https://doi.org/10.1080/00207160701331376","mag":"2022297072"},"language":"en","primary_location":{"id":"doi:10.1080/00207160701331376","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701331376","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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 Mathematics","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/A5052412149","display_name":"Shahul Hamid Khan","orcid":"https://orcid.org/0000-0001-7400-9284"},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"B. Shahul Hamid Khan","raw_affiliation_strings":["National Institute of Technology","Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Technology","institution_ids":[]},{"raw_affiliation_string":"Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061310221","display_name":"G. Prabhaharan","orcid":null},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"G. Prabhaharan","raw_affiliation_strings":["National Institute of Technology","Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Technology","institution_ids":[]},{"raw_affiliation_string":"Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India","institution_ids":["https://openalex.org/I122964287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076171540","display_name":"P. Asokan","orcid":null},"institutions":[{"id":"https://openalex.org/I122964287","display_name":"National Institute of Technology Tiruchirappalli","ror":"https://ror.org/047x65e68","country_code":"IN","type":"education","lineage":["https://openalex.org/I122964287"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Asokan","raw_affiliation_strings":["National Institute of Technology","Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India"],"affiliations":[{"raw_affiliation_string":"National Institute of Technology","institution_ids":[]},{"raw_affiliation_string":"Department of Production Engineering, National Institute of Technology, Tiruchirappalli, India","institution_ids":["https://openalex.org/I122964287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052412149"],"corresponding_institution_ids":["https://openalex.org/I122964287"],"apc_list":null,"apc_paid":null,"fwci":0.847,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.77904581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"84","issue":"12","first_page":"1731","last_page":"1741"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9966999888420105,"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.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.9071948528289795},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9049148559570312},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.741983950138092},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7144031524658203},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6707702279090881},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.6194173097610474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5826046466827393},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5740916728973389},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5176916122436523},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4860678017139435},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.48133715987205505},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.43641868233680725},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.41792047023773193},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.4169677495956421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3745272755622864},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07238739728927612}],"concepts":[{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.9071948528289795},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9049148559570312},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.741983950138092},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7144031524658203},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6707702279090881},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.6194173097610474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5826046466827393},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5740916728973389},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5176916122436523},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4860678017139435},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.48133715987205505},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.43641868233680725},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.41792047023773193},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.4169677495956421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3745272755622864},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07238739728927612},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160701331376","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160701331376","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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 Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W58198252","https://openalex.org/W1506768432","https://openalex.org/W1970150270","https://openalex.org/W1987255189","https://openalex.org/W1989396603","https://openalex.org/W1990848197","https://openalex.org/W1996246029","https://openalex.org/W2023170315","https://openalex.org/W2024085737","https://openalex.org/W2044730412","https://openalex.org/W2052222195","https://openalex.org/W2059751140","https://openalex.org/W2079121918","https://openalex.org/W2090069860","https://openalex.org/W2090275183","https://openalex.org/W2095303169","https://openalex.org/W2110376540","https://openalex.org/W2118371226","https://openalex.org/W2156391157","https://openalex.org/W2997776631"],"related_works":["https://openalex.org/W2089884908","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W2794855054","https://openalex.org/W2005169299","https://openalex.org/W2606087467","https://openalex.org/W1540477665","https://openalex.org/W150166259","https://openalex.org/W2314520391","https://openalex.org/W2085776465"],"abstract_inverted_index":{"In":[0],"this":[1,39],"paper":[2],"we":[3],"address":[4],"the":[5,9,29,68,107,122,129],"problem":[6,27,40,80],"of":[7,12,71],"minimizing":[8],"weighted":[10],"sum":[11],"makespan":[13],"and":[14,56,81,104,116],"maximum":[15],"tardiness":[16],"in":[17,28,132],"an":[18],"m-machine":[19],"flow":[20,78],"shop":[21,79],"environment.":[22],"This":[23],"is":[24,52,57,90,96,125],"a":[25,42,53,58,76,82],"NP-hard":[26],"strong":[30],"sense.":[31],"An":[32],"attempt":[33],"has":[34],"been":[35],"made":[36],"to":[37,74],"solve":[38,75],"using":[41,98],"metaheuristic":[43],"called":[44],"Greedy":[45],"Randomized":[46],"Adaptive":[47],"Search":[48],"Procedure":[49],"(GRASP).":[50],"GRASP":[51,72,88],"competitive":[54],"algorithm":[55,73,84,95,124],"meta-heuristic":[59],"for":[60],"solving":[61],"combinatorial":[62],"optimization":[63],"problems.":[64],"We":[65],"have":[66],"customized":[67],"basic":[69],"concepts":[70],"bicriteria":[77],"new":[83,93],"named":[85],"B-GRASP":[86],"(Bicriteria":[87],"algorithm)":[89],"proposed.":[91],"The":[92],"proposed":[94,123],"evaluated":[97],"benchmark":[99],"problems":[100],"taken":[101],"from":[102],"Taillard":[103],"compared":[105],"with":[106],"existing":[108,130],"simulated":[109],"annealing":[110],"based":[111],"heuristic":[112],"developed":[113],"by":[114],"Chakravarthy":[115],"Rajendran.":[117],"Computational":[118],"experiments":[119],"indicate":[120],"that":[121],"much":[126],"better":[127],"than":[128],"one":[131],"all":[133],"cases.":[134]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-06T06:45:51.903784","created_date":"2025-10-10T00:00:00"}