{"id":"https://openalex.org/W1964928578","doi":"https://doi.org/10.1051/ro:2001110","title":"Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine","display_name":"Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W1964928578","doi":"https://doi.org/10.1051/ro:2001110","mag":"1964928578"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2001110","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2001110","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-02548214","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048947754","display_name":"Philippe Chr\u00e9tienne","orcid":"https://orcid.org/0000-0002-4507-5757"},"institutions":[{"id":"https://openalex.org/I4210159731","display_name":"Laboratoire de Recherche en Informatique de Paris 6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Philippe Chr\u00e9tienne","raw_affiliation_strings":["LIP6, P\u00f4le IA, UPMC, 8 rue du Capitaine Scott, 75015 Paris, France; Philippe.Chretienne@lip6.fr","LIP6, P\u00f4le IA, UPMC, 8 rue du Capitaine Scott, 75015 Paris, France"],"affiliations":[{"raw_affiliation_string":"LIP6, P\u00f4le IA, UPMC, 8 rue du Capitaine Scott, 75015 Paris, France; Philippe.Chretienne@lip6.fr","institution_ids":[]},{"raw_affiliation_string":"LIP6, P\u00f4le IA, UPMC, 8 rue du Capitaine Scott, 75015 Paris, France","institution_ids":["https://openalex.org/I4210159731","https://openalex.org/I39804081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048947754"],"corresponding_institution_ids":["https://openalex.org/I39804081","https://openalex.org/I4210159731"],"apc_list":null,"apc_paid":null,"fwci":2.3707,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.86797753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"35","issue":"2","first_page":"165","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9997000098228455,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.984499990940094,"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/tardiness","display_name":"Tardiness","score":0.9430955648422241},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.611467182636261},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5871113538742065},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5559000372886658},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.517140805721283},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4956587553024292},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.48996153473854065},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4477904140949249},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4469949007034302},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4354126453399658},{"id":"https://openalex.org/keywords/total-cost","display_name":"Total cost","score":0.4308410882949829},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4270639419555664},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3809458315372467},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.31645649671554565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30676692724227905},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16496381163597107},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12580230832099915},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07102113962173462}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9430955648422241},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.611467182636261},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5871113538742065},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5559000372886658},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.517140805721283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4956587553024292},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.48996153473854065},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4477904140949249},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4469949007034302},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4354126453399658},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.4308410882949829},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4270639419555664},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3809458315372467},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.31645649671554565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30676692724227905},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16496381163597107},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12580230832099915},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07102113962173462},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:2001110","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2001110","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01185816v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01185816","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":"RAIRO - Operations Research, 2001, 35 (2), pp.165-187. ⟨10.1051/ro:2001110⟩","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:hal-02548214v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02548214","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] lip6.1999.007, LIP6. 1999","raw_type":"Reports"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02548214v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02548214","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] lip6.1999.007, LIP6. 1999","raw_type":"Reports"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W602487594","https://openalex.org/W1976061398","https://openalex.org/W1992198745","https://openalex.org/W2088060524","https://openalex.org/W2093563804","https://openalex.org/W2146665054","https://openalex.org/W2276535802"],"related_works":["https://openalex.org/W2153799489","https://openalex.org/W2060337406","https://openalex.org/W4381616416","https://openalex.org/W2057653555","https://openalex.org/W2131482998","https://openalex.org/W4251798786","https://openalex.org/W2167746336","https://openalex.org/W2377478537","https://openalex.org/W2051555966","https://openalex.org/W1991096018"],"abstract_inverted_index":{"Assume":[0],"that":[1,46,83,118],"n":[2],"tasks":[3,56],"must":[4],"be":[5],"processed":[6],"by":[7,51],"one":[8],"machine":[9],"in":[10,130],"a":[11,42,64,114,126,131],"fixed":[12],"sequence.":[13],"The":[14,35],"processing":[15],"time,":[16],"the":[17,22,47,52,69,86,99,122],"preferred":[18],"starting":[19,43],"time":[20,28,44],"and":[21,24,54,74,90,104],"earliness":[23],"tardiness":[25],"costs":[26],"per":[27],"unit":[29],"are":[30],"known":[31],"for":[32,68],"each":[33,40],"task.":[34],"problem":[36,124],"is":[37,57],"to":[38,85,120],"allocate":[39],"task":[41],"such":[45],"total":[48],"cost":[49,92,128],"incurred":[50],"early":[53],"tardy":[55],"minimum.":[58],"Garey":[59],"et":[60],"al.":[61],"have":[62],"proposed":[63],"nice":[65],"O(nlogn)":[66],"algorithm":[67,84,111],"special":[70],"case":[71,87,101],"of":[72,88,102],"symmetric":[73],"task-independent":[75,91],"costs.":[76],"In":[77],"this":[78],"paper":[79],"we":[80,107],"first":[81],"extend":[82],"asymmetric":[89,103],"without":[93],"increasing":[94],"its":[95],"worst-case":[96],"complexity.":[97],"For":[98],"general":[100],"task-dependent":[105],"costs,":[106],"propose":[108],"an":[109],"O(n3logn)":[110],"based":[112],"on":[113],"strong":[115],"dominance":[116],"property":[117],"yields":[119],"model":[121],"scheduling":[123],"as":[125],"minimum":[127],"path":[129],"valued":[132],"directed":[133],"acyclic":[134],"graph.":[135]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}