{"id":"https://openalex.org/W2090959708","doi":"https://doi.org/10.1109/dictap.2014.6821721","title":"Notice of Violation of IEEE Publication Principles: Enhancement of jobshop scheduling problem using search optimization","display_name":"Notice of Violation of IEEE Publication Principles: Enhancement of jobshop scheduling problem using search optimization","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2090959708","doi":"https://doi.org/10.1109/dictap.2014.6821721","mag":"2090959708"},"language":"en","primary_location":{"id":"doi:10.1109/dictap.2014.6821721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","raw_type":"proceedings-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/A5041217658","display_name":"Vinay P. Viradia","orcid":null},"institutions":[{"id":"https://openalex.org/I33459947","display_name":"Charotar University of Science and Technology","ror":"https://ror.org/0442pkv24","country_code":"IN","type":"education","lineage":["https://openalex.org/I33459947"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vinay P. Viradia","raw_affiliation_strings":["Department of Computer Engineering, Charotar University Of Science and Technology, Changa Anand, Gujarat, India","Department of Computer Engineering, Charotar University Of Science and Technology, Changa, Anand, Gujarat, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Charotar University Of Science and Technology, Changa Anand, Gujarat, India","institution_ids":["https://openalex.org/I33459947"]},{"raw_affiliation_string":"Department of Computer Engineering, Charotar University Of Science and Technology, Changa, Anand, Gujarat, India","institution_ids":["https://openalex.org/I33459947"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025539382","display_name":"Chintan Bhatt","orcid":"https://orcid.org/0000-0002-0423-0159"},"institutions":[{"id":"https://openalex.org/I33459947","display_name":"Charotar University of Science and Technology","ror":"https://ror.org/0442pkv24","country_code":"IN","type":"education","lineage":["https://openalex.org/I33459947"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Chintan M Bhatt","raw_affiliation_strings":["Department of Computer Engineering, Charotar University Of Science and Technology, Changa Anand, Gujarat, India","Department of Computer Engineering, Charotar University Of Science and Technology, Changa, Anand, Gujarat, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Charotar University Of Science and Technology, Changa Anand, Gujarat, India","institution_ids":["https://openalex.org/I33459947"]},{"raw_affiliation_string":"Department of Computer Engineering, Charotar University Of Science and Technology, Changa, Anand, Gujarat, India","institution_ids":["https://openalex.org/I33459947"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041217658"],"corresponding_institution_ids":["https://openalex.org/I33459947"],"apc_list":null,"apc_paid":null,"fwci":0.6158,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.76396769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"411","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991000294685364,"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.9991000294685364,"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.9962000250816345,"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.9957000017166138,"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/notice","display_name":"Notice","score":0.8086612224578857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6179256439208984},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5921093225479126},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5854937434196472},{"id":"https://openalex.org/keywords/permission","display_name":"Permission","score":0.5344338417053223},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3450654149055481},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33268165588378906},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3064998984336853},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19902950525283813},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.159081369638443},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.09576532244682312},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08870676159858704}],"concepts":[{"id":"https://openalex.org/C2779913896","wikidata":"https://www.wikidata.org/wiki/Q7063001","display_name":"Notice","level":2,"score":0.8086612224578857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6179256439208984},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5921093225479126},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5854937434196472},{"id":"https://openalex.org/C2779089604","wikidata":"https://www.wikidata.org/wiki/Q7169333","display_name":"Permission","level":2,"score":0.5344338417053223},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3450654149055481},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33268165588378906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3064998984336853},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19902950525283813},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.159081369638443},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.09576532244682312},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08870676159858704},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dictap.2014.6821721","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dictap.2014.6821721","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Fourth International Conference on Digital Information and Communication Technology and its Applications (DICTAP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1559956479","https://openalex.org/W1596914020","https://openalex.org/W1748717780","https://openalex.org/W2035364028","https://openalex.org/W2107941094","https://openalex.org/W2187531528","https://openalex.org/W2228680884","https://openalex.org/W2239924092","https://openalex.org/W2326592273","https://openalex.org/W2336576244","https://openalex.org/W2951464652","https://openalex.org/W4285719527","https://openalex.org/W6637809739","https://openalex.org/W6687075245","https://openalex.org/W6690137439","https://openalex.org/W6703624848"],"related_works":["https://openalex.org/W2374086689","https://openalex.org/W3176279093","https://openalex.org/W2373945265","https://openalex.org/W2370203001","https://openalex.org/W1912565424","https://openalex.org/W3204654320","https://openalex.org/W2025955409","https://openalex.org/W1577301438","https://openalex.org/W1986410062","https://openalex.org/W4231062255"],"abstract_inverted_index":{"Notice":[0],"of":[1,3,7,22,45,50,68,76,108,134,146,192,213,254,292,295],"Violation":[2],"IEEE":[4],"Publication":[5,70],"Principles<br><br>\"Enhancement":[6],"Jobshop":[8,135,162],"Scheduling":[9,136],"Problem":[10,137],"Using":[11,138],"Search":[12,139],"Optimization\"<br>by":[13,140],"Vinay":[14],"P.":[15],"Viradia,":[16],"Chintan":[17],"M.":[18],"Bhatt<br>in":[19],"the":[20,23,46,77,81,96,106,131,144,147,252,255,271,289],"Proceedings":[21,145],"Fourth":[24],"International":[25],"Conference":[26,150],"on":[27,151],"Digital":[28],"Information":[29],"and":[30,33,42,48,102,124,153,171,194,216,221,232,269],"Communication":[31],"Technology":[32],"its":[34],"Applications":[35],"(DICTAP),":[36],"May":[37],"2014,":[38,158],"pp.":[39,159],"411-414<br><br>After":[40],"careful":[41],"considered":[43],"review":[44],"content":[47],"authorship":[49],"this":[51,59,109,122,250],"paper":[52,60,72,82,100,283],"by":[53],"a":[54,74,165,185,211],"duly":[55],"constituted":[56],"expert":[57],"committee,":[58],"has":[61],"been":[62],"found":[63],"to":[64,95,105,116,121,130,196,236,245,262,287],"be":[65,114,128,237],"in":[66,188,240],"violation":[67],"IEEE\u2019s":[69],"Principles.<br><br>This":[71],"is":[73,164,174,184,210,218,267,284],"duplication":[75],"original":[78,86,97],"text":[79,87],"from":[80],"cited":[83],"below.":[84],"The":[85],"was":[88],"copied":[89],"without":[90,103],"attribution":[91],"(including":[92],"appropriate":[93],"references":[94,120,126],"author(s)":[98],"and/or":[99],"title)":[101],"permission.<br><br>Due":[104],"nature":[107],"violation,":[110],"reasonable":[111],"effort":[112],"should":[113,127],"made":[115,129],"remove":[117],"all":[118,225],"past":[119],"paper,":[123,251],"future":[125],"following":[132],"article:<br><br>\"Enhancement":[133],"Sneha":[141],"A.":[142],"Gaywala<br>in":[143],"Second":[148],"National":[149],"Innovative":[152],"Emerging":[154],"Technologies":[155],"(NCIET),":[156],"January":[157],"81-83<br><br>":[160],"<br/>":[161],"scheduling":[163,209,227],"most":[166,219],"difficult":[167],"problem,":[168],"both":[169],"theoretically":[170],"practically.":[172],"It":[173],"classified":[175],"as":[176,204],"NP-Hard":[177],"Problem.":[178],"Nature":[179,229],"Inspired":[180],"(or":[181],"bio-inspired)":[182],"Algorithms":[183],"new":[186],"age":[187],"layering":[189],"spacious":[190],"series":[191],"applications":[193],"solution":[195],"different":[197],"optimization":[198,215,265,276],"problems.":[199,248,298],"These":[200],"algorithms":[201,231,234],"are":[202],"known":[203],"clever":[205],"algorithms.":[206],"Job":[207],"shop":[208,226],"problem":[212,223],"constrained":[214],"it":[217],"universal":[220],"complex":[222,247],"among":[224],"problems":[228],"inspired":[230],"approximation":[233],"seem":[235],"very":[238],"effective":[239],"giving":[241],"near":[242],"optimal":[243],"solutions":[244],"such":[246],"In":[249],"concept":[253],"cuckoo":[256,274],"search":[257,275],"(CS)":[258],"algorithm":[259,277],"(metaheuristic":[260],"approach":[261,272,291],"solve":[263],"structural":[264],"problems)":[266],"elaborated":[268],"estimate":[270],"that":[273],"can":[278],"perform":[279],"more":[280],"efficiently.":[281],"This":[282],"also":[285],"trying":[286],"give":[288],"better":[290],"reducing":[293],"makespan":[294],"jobshop":[296],"benchmark":[297]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}