{"id":"https://openalex.org/W2128887355","doi":"https://doi.org/10.1109/icsmc.2004.1399840","title":"Minimizing total tardiness on a single machine with sequence-dependent setup times","display_name":"Minimizing total tardiness on a single machine with sequence-dependent setup times","publication_year":2005,"publication_date":"2005-03-31","ids":{"openalex":"https://openalex.org/W2128887355","doi":"https://doi.org/10.1109/icsmc.2004.1399840","mag":"2128887355"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2004.1399840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1399840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5089209993","display_name":"Ahmed Souissi","orcid":"https://orcid.org/0000-0002-8112-9345"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Souissi","raw_affiliation_strings":["ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075247612","display_name":"Imed Kacem","orcid":"https://orcid.org/0000-0001-6649-7257"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]},{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"I. Kacem","raw_affiliation_strings":["ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100741513","display_name":"Chengbin Chu","orcid":"https://orcid.org/0000-0002-1837-4380"},"institutions":[{"id":"https://openalex.org/I140494188","display_name":"Universit\u00e9 de Technologie de Troyes","ror":"https://ror.org/01qhqcj41","country_code":"FR","type":"education","lineage":["https://openalex.org/I140494188"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C. Chu","raw_affiliation_strings":["ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISTIT-OSI, Universit\u00e9 de Technologie de Troyes, France","institution_ids":["https://openalex.org/I140494188"]},{"raw_affiliation_string":"LOSI - Laboratoire d'Optimisation des Syst\u00e8mes Industriels (12 rue Marie Curie, F-10010 Troyes - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1481","last_page":"1485"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9918000102043152,"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.9854000210762024,"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.9859246015548706},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.7115967273712158},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.675210177898407},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6681874990463257},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6146582961082458},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5631832480430603},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5546174645423889},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5452159643173218},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.48044702410697937},{"id":"https://openalex.org/keywords/retard","display_name":"Retard","score":0.47044649720191956},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.43069493770599365},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4155277609825134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3835238218307495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22461286187171936},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07806271314620972}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9859246015548706},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.7115967273712158},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.675210177898407},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6681874990463257},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6146582961082458},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5631832480430603},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5546174645423889},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5452159643173218},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.48044702410697937},{"id":"https://openalex.org/C2777131613","wikidata":"https://www.wikidata.org/wiki/Q18394147","display_name":"Retard","level":2,"score":0.47044649720191956},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.43069493770599365},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4155277609825134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3835238218307495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22461286187171936},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07806271314620972},{"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/C118552586","wikidata":"https://www.wikidata.org/wiki/Q7867","display_name":"Psychiatry","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","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},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icsmc.2004.1399840","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2004.1399840","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02497493v1","is_oa":false,"landing_page_url":"https://utt.hal.science/hal-02497493","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":"2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), Oct 2004, The Hague, Netherlands. pp.1481-1485, ⟨10.1109/ICSMC.2004.1399840⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1976515159","https://openalex.org/W1982878652","https://openalex.org/W1984809851","https://openalex.org/W2001786211","https://openalex.org/W2007518229","https://openalex.org/W2024604250","https://openalex.org/W2047301473","https://openalex.org/W2096833120","https://openalex.org/W2113856408","https://openalex.org/W2137302605","https://openalex.org/W2405730667"],"related_works":["https://openalex.org/W2060337406","https://openalex.org/W2153799489","https://openalex.org/W1992259816","https://openalex.org/W2057653555","https://openalex.org/W4381616416","https://openalex.org/W2131482998","https://openalex.org/W4251798786","https://openalex.org/W2377478537","https://openalex.org/W1991096018","https://openalex.org/W2051555966"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,33],"study":[4],"the":[5],"single":[6],"machine":[7],"scheduling":[8],"problem":[9,19],"with":[10,52],"setup":[11],"times":[12],"for":[13],"minimizing":[14],"total":[15],"tardiness.":[16],"Such":[17],"a":[18,35,45],"is":[20,42,50],"NP-hard":[21],"and":[22,37,49,59,71],"presents":[23],"many":[24],"difficulties":[25],"to":[26],"be":[27],"solved.":[28],"To":[29],"reduce":[30],"these":[31],"difficulties,":[32],"propose":[34],"branch":[36],"bound":[38,48],"algorithm.":[39],"Our":[40],"method":[41],"based":[43],"on":[44],"new":[46],"lower":[47,54],"compared":[51],"Ragatz":[53],"bound.":[55],"New":[56],"dominance":[57],"rule":[58],"original":[60],"exploration":[61],"strategy":[62],"are":[63,69],"also":[64],"proposed.":[65],"Preliminary":[66],"numerical":[67],"simulations":[68],"encouraging":[70],"promising.":[72]},"counts_by_year":[],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}