{"id":"https://openalex.org/W2024580471","doi":"https://doi.org/10.1109/imcsit.2009.5352753","title":"A time-indexed formulation of earliness tardiness scheduling via DC programming and DCA","display_name":"A time-indexed formulation of earliness tardiness scheduling via DC programming and DCA","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2024580471","doi":"https://doi.org/10.1109/imcsit.2009.5352753","mag":"2024580471"},"language":"en","primary_location":{"id":"doi:10.1109/imcsit.2009.5352753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcsit.2009.5352753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Multiconference on Computer Science and Information Technology","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/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hoai An Le Thi","raw_affiliation_strings":["Laboratory fo Theoretical and Applied Computer Science LITA UFR MIM, Paul Verlaine Metz University, Metz, France","Laboratory of Theoretical and Applied Computer Science, (LITA), UFR MIM, Paul Verlaine University - Metz, \u00cele du Saulcy, 57045, France"],"affiliations":[{"raw_affiliation_string":"Laboratory fo Theoretical and Applied Computer Science LITA UFR MIM, Paul Verlaine Metz University, Metz, France","institution_ids":[]},{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science, (LITA), UFR MIM, Paul Verlaine University - Metz, \u00cele du Saulcy, 57045, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011023868","display_name":"Quang Thuan Nguyen","orcid":"https://orcid.org/0009-0006-2259-8404"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen Quang Thuan","raw_affiliation_strings":["Laboratory fo Theoretical and Applied Computer Science LITA UFR MIM, Paul Verlaine Metz University, Metz, France","Laboratory of Theoretical and Applied Computer Science, (LITA), UFR MIM, Paul Verlaine University - Metz, \u00cele du Saulcy, 57045, France"],"affiliations":[{"raw_affiliation_string":"Laboratory fo Theoretical and Applied Computer Science LITA UFR MIM, Paul Verlaine Metz University, Metz, France","institution_ids":[]},{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science, (LITA), UFR MIM, Paul Verlaine University - Metz, \u00cele du Saulcy, 57045, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064027518","display_name":"Nguyen Huynh Tuong","orcid":"https://orcid.org/0000-0001-6592-4480"},"institutions":[{"id":"https://openalex.org/I110017253","display_name":"Universit\u00e9 de Tours","ror":"https://ror.org/02wwzvj46","country_code":"FR","type":"education","lineage":["https://openalex.org/I110017253"]},{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nguyen Huynh Tuong","raw_affiliation_strings":["Laboratory of Informatics, University of Fran\u00e7ois Rebalais, Tours, France","Laboratory of Modeling, Optimization and Operations Research, National Institute for Applied Science, Rouen BP08,Place Emile Blondel, 76131 Mont Saint Aignan, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Informatics, University of Fran\u00e7ois Rebalais, Tours, France","institution_ids":["https://openalex.org/I110017253"]},{"raw_affiliation_string":"Laboratory of Modeling, Optimization and Operations Research, National Institute for Applied Science, Rouen BP08,Place Emile Blondel, 76131 Mont Saint Aignan, France","institution_ids":["https://openalex.org/I88814501"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112593835","display_name":"Tao Pham Dinh","orcid":null},"institutions":[{"id":"https://openalex.org/I196454796","display_name":"Institut National des Sciences Appliqu\u00e9es de Toulouse","ror":"https://ror.org/01h8pf755","country_code":"FR","type":"education","lineage":["https://openalex.org/I196454796","https://openalex.org/I4405258862"]},{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Tao Pham Dinh","raw_affiliation_strings":["Laboratory of Modeling Optimization and Operations Research, National Institute for Applied Sciences, Mont Saint Aignan, France","Laboratory of Modeling, Optimization and Operations Research, National Institute for Applied Science, Rouen BP08,Place Emile Blondel, 76131 Mont Saint Aignan, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Modeling Optimization and Operations Research, National Institute for Applied Sciences, Mont Saint Aignan, France","institution_ids":["https://openalex.org/I196454796"]},{"raw_affiliation_string":"Laboratory of Modeling, Optimization and Operations Research, National Institute for Applied Science, Rouen BP08,Place Emile Blondel, 76131 Mont Saint Aignan, France","institution_ids":["https://openalex.org/I88814501"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5042936176"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14895928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"22","issue":null,"first_page":"779","last_page":"784"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9914000034332275,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.9260377883911133},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6433345079421997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6400656700134277},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6086624264717102},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5906083583831787},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.49860191345214844},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46159908175468445},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4575061798095703},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42043763399124146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35735267400741577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27630534768104553},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.0665421187877655},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.04951143264770508}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9260377883911133},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6433345079421997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6400656700134277},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6086624264717102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5906083583831787},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.49860191345214844},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46159908175468445},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4575061798095703},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42043763399124146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35735267400741577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27630534768104553},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0665421187877655},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.04951143264770508},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/imcsit.2009.5352753","is_oa":false,"landing_page_url":"https://doi.org/10.1109/imcsit.2009.5352753","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Multiconference on Computer Science and Information Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03214436v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-03214436","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2009 International Multiconference on Computer Science and Information Technology (IMCSIT), Oct 2009, Mragowo, Poland. pp.779-784, ⟨10.1109/IMCSIT.2009.5352753⟩","raw_type":"Conference papers"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/34735","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/34735","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication dans un congr\u00e8s avec actes"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5299999713897705}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W103048894","https://openalex.org/W165498066","https://openalex.org/W1529681250","https://openalex.org/W1589133845","https://openalex.org/W1976061398","https://openalex.org/W1987507268","https://openalex.org/W1990494141","https://openalex.org/W1998976244","https://openalex.org/W2006079335","https://openalex.org/W2039823842","https://openalex.org/W2047685618","https://openalex.org/W2047928292","https://openalex.org/W2051664786","https://openalex.org/W2060346111","https://openalex.org/W2060552317","https://openalex.org/W2067436380","https://openalex.org/W2130399617","https://openalex.org/W2148146087","https://openalex.org/W2159152246","https://openalex.org/W2162152253","https://openalex.org/W2340859457","https://openalex.org/W3081544918","https://openalex.org/W4285719527","https://openalex.org/W4293507785"],"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/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W74759090","https://openalex.org/W2768876727"],"abstract_inverted_index":{"Time-index":[0],"formulation":[1,41],"for":[2,47,72],"the":[3],"earliness":[4],"tardiness":[5],"scheduling":[6],"problem":[7],"has":[8],"received":[9],"a":[10,45],"great":[11],"attention":[12],"from":[13],"many":[14],"researchers":[15],"because":[16],"lower":[17],"bound":[18,70],"obtained":[19,77],"by":[20,42],"linear":[21],"relaxation":[22],"is":[23,28],"rather":[24],"good.":[25],"Much":[26],"work":[27],"devoted":[29],"to":[30,67],"tackle":[31],"its":[32],"upper":[33,69],"bound.":[34],"In":[35],"this":[36,40,73],"paper,":[37],"we":[38],"consider":[39],"additionally":[43],"proposing":[44],"deadline":[46],"each":[48],"job.":[49],"We":[50],"also":[51],"propose":[52],"an":[53],"approach":[54],"based":[55],"on":[56],"DC":[57],"(Difference":[58],"of":[59],"Convex":[60],"functions)":[61],"programming":[62],"and":[63],"DCA":[64],"(DC":[65],"Algorithm)":[66],"find":[68],"efficiently":[71],"problem.":[74],"The":[75],"results":[76],"are":[78],"promising.":[79]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}