{"id":"https://openalex.org/W2067391087","doi":"https://doi.org/10.1109/cec.2009.4983056","title":"An efficient scatter search algorithm for minimizing earliness and tardiness penalties in a single-machine scheduling problem with a common due date","display_name":"An efficient scatter search algorithm for minimizing earliness and tardiness penalties in a single-machine scheduling problem with a common due date","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2067391087","doi":"https://doi.org/10.1109/cec.2009.4983056","mag":"2067391087"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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/A5112278295","display_name":"J. Talebi","orcid":null},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"J. Talebi","raw_affiliation_strings":["Department of industrial engineering, University of Tehran, Iran","[Department of Industrial Engineering, University of Tehran, Iran]"],"affiliations":[{"raw_affiliation_string":"Department of industrial engineering, University of Tehran, Iran","institution_ids":["https://openalex.org/I23946033"]},{"raw_affiliation_string":"[Department of Industrial Engineering, University of Tehran, Iran]","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089802725","display_name":"Hossein Badri","orcid":null},"institutions":[{"id":"https://openalex.org/I119025939","display_name":"Shahed University","ror":"https://ror.org/01e8ff003","country_code":"IR","type":"education","lineage":["https://openalex.org/I119025939"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"H. Badri","raw_affiliation_strings":["Department of industrial engineering, University of Shahed, Iran","Department of industrial engineering, University of Shahed, Iran#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of industrial engineering, University of Shahed, Iran","institution_ids":["https://openalex.org/I119025939"]},{"raw_affiliation_string":"Department of industrial engineering, University of Shahed, Iran#TAB#","institution_ids":["https://openalex.org/I119025939"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069932350","display_name":"F. Ghaderi","orcid":null},"institutions":[{"id":"https://openalex.org/I23946033","display_name":"University of Tehran","ror":"https://ror.org/05vf56z40","country_code":"IR","type":"education","lineage":["https://openalex.org/I23946033"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"F. Ghaderi","raw_affiliation_strings":["Department of industrial engineering, University of Tehran, Iran","[Department of Industrial Engineering, University of Tehran, Iran]"],"affiliations":[{"raw_affiliation_string":"Department of industrial engineering, University of Tehran, Iran","institution_ids":["https://openalex.org/I23946033"]},{"raw_affiliation_string":"[Department of Industrial Engineering, University of Tehran, Iran]","institution_ids":["https://openalex.org/I23946033"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024159030","display_name":"Elaheh KHOSRAVIAN","orcid":null},"institutions":[{"id":"https://openalex.org/I127908078","display_name":"Shahrekord University","ror":"https://ror.org/051rngw70","country_code":"IR","type":"education","lineage":["https://openalex.org/I127908078"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"E. Khosravian","raw_affiliation_strings":["Department of mechanical engineering, University of Shahrekord, Iran"],"affiliations":[{"raw_affiliation_string":"Department of mechanical engineering, University of Shahrekord, Iran","institution_ids":["https://openalex.org/I127908078"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112278295"],"corresponding_institution_ids":["https://openalex.org/I23946033"],"apc_list":null,"apc_paid":null,"fwci":0.7503,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7740744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"177","issue":null,"first_page":"1012","last_page":"1018"},"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.9973999857902527,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.9774148464202881},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.7448650002479553},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7318721413612366},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7023669481277466},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6905792355537415},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6569933891296387},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6512640714645386},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5480841994285583},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5198814868927002},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41456156969070435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2492678463459015},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05466747283935547}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9774148464202881},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.7448650002479553},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7318721413612366},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7023669481277466},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6905792355537415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6569933891296387},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6512640714645386},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5480841994285583},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5198814868927002},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41456156969070435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2492678463459015},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05466747283935547},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983056","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983056","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1551167422","https://openalex.org/W1586603169","https://openalex.org/W1964447957","https://openalex.org/W1997456623","https://openalex.org/W2028324047","https://openalex.org/W2032069874","https://openalex.org/W2037522254","https://openalex.org/W2056177557","https://openalex.org/W2062701203","https://openalex.org/W2071655577","https://openalex.org/W2084068443","https://openalex.org/W2091164478","https://openalex.org/W2093563804","https://openalex.org/W2124388232","https://openalex.org/W2124496116","https://openalex.org/W2125509133","https://openalex.org/W3124078508"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2162966494","https://openalex.org/W2017557756","https://openalex.org/W2951717752","https://openalex.org/W2006534204","https://openalex.org/W4251798786","https://openalex.org/W1974309933","https://openalex.org/W2074319831"],"abstract_inverted_index":{"Since":[0],"the":[1,9,53,70,73,81,96],"just-in-time":[2],"(JIT)":[3],"problems":[4,36,121],"have":[5,14,44],"special":[6],"importance":[7],"in":[8,28,64,94,140],"real":[10],"world,":[11],"various":[12],"methods":[13,43],"been":[15,45],"developed":[16],"by":[17,69],"researchers":[18],"to":[19,124,129],"solve":[20],"this":[21,51],"kind":[22],"of":[23,34,41,72,75,80,98,101],"problem":[24,56],"more":[25],"precisely":[26],"and":[27,77],"a":[29,58,86,114,131],"minimal":[30],"possible":[31],"time.":[32],"Most":[33],"JIT":[35],"are":[37,105],"NP-hard,":[38],"thus":[39],"many":[40],"these":[42],"created":[46],"based":[47,89],"on":[48,90],"metaheuristics.":[49],"In":[50,127],"paper":[52],"single-machine":[54],"scheduling":[55],"with":[57,118,122],"common":[59],"due":[60],"date":[61],"is":[62,67,111],"considered":[63],"which":[65,95],"performance":[66],"measured":[68],"minimization":[71,104],"sum":[74],"earliness":[76],"tardiness":[78],"penalties":[79],"jobs.":[82,126],"Here":[83],"we":[84,135],"use":[85],"solving":[87],"method":[88],"Scatter":[91],"Search":[92],"metaheuristic":[93],"features":[97],"optimal":[99],"solution":[100,133],"single":[102],"machine":[103],"utilized":[106],"appropriately.":[107],"The":[108],"proposed":[109,145],"approach":[110],"examined":[112],"through":[113],"computational":[115],"comparative":[116],"study":[117],"280":[119],"benchmark":[120],"up":[123],"1000":[125],"addition":[128],"having":[130],"good":[132],"time,":[134],"got":[136],"new":[137],"upper":[138],"bounds":[139],"our":[141],"numerical":[142],"examples":[143],"using":[144],"method.":[146]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}