{"id":"https://openalex.org/W362556469","doi":null,"title":"Solutions to the dynamic average tardiness problem in single machine environments","display_name":"Solutions to the dynamic average tardiness problem in single machine environments","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W362556469","mag":"362556469"},"language":"es","primary_location":{"id":"mag:362556469","doi":null,"is_oa":false,"landing_page_url":"http://sedici.unlp.edu.ar/bitstream/handle/10915/22728/Documento_completo.pdf?sequence=1","pdf_url":null,"source":{"id":"https://openalex.org/S4306514708","display_name":"IX Congreso Argentino de Ciencias de la Computaci\u00f3n","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IX Congreso Argentino de Ciencias de la Computaci\u00f3n","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5026659633","display_name":"Mar\u00eda Eugenia de San Pedro","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mar\u00eda Eugenia de San Pedro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058629872","display_name":"Marta Graciela Lasso","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marta Graciela Lasso","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070912031","display_name":"Andrea Villagra","orcid":"https://orcid.org/0000-0003-1285-2959","observed_orcids":["https://orcid.org/0000-0003-1285-2959"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Villagra","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1285-2959","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081527174","display_name":"Daniel Raul Pandolfi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Pandolfi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108723918","display_name":"Ra\u00fal H\u00e9ctor Gallard","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ra\u00fal H\u00e9ctor Gallard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8916,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.8035281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11773","display_name":"Healthcare Operations and Scheduling Optimization","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-scheduling","display_name":"dynamic scheduling","score":0.8840000033378601},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"single machine scheduling","score":0.9919999837875366},{"id":"https://openalex.org/keywords/dispatching-rules","display_name":"dispatching rules","score":0.8610000014305115},{"id":"https://openalex.org/keywords/scheduling-heuristics","display_name":"heuristic scheduling","score":0.5460000038146973}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.95506751537323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6594231128692627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5962281227111816},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5705238580703735},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5637868046760559},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.5591790676116943},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5452604293823242},{"id":"https://openalex.org/C2775836275","wikidata":"https://www.wikidata.org/wiki/Q3502310","display_name":"Dynamism","level":2,"score":0.536361038684845},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5125577449798584},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5091747641563416},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4768437147140503},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4698590040206909},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.45844766497612},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.35137954354286194},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25720131397247314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2049315869808197},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10469818115234375},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:362556469","doi":null,"is_oa":false,"landing_page_url":"http://sedici.unlp.edu.ar/bitstream/handle/10915/22728/Documento_completo.pdf?sequence=1","pdf_url":null,"source":{"id":"https://openalex.org/S4306514708","display_name":"IX Congreso Argentino de Ciencias de la Computaci\u00f3n","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IX Congreso Argentino de Ciencias de la Computaci\u00f3n","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1483551566","https://openalex.org/W1507582389","https://openalex.org/W1922848450","https://openalex.org/W2014653572","https://openalex.org/W2042312329","https://openalex.org/W2057185508","https://openalex.org/W2122757685","https://openalex.org/W2122967269","https://openalex.org/W2160657530","https://openalex.org/W6922240264"],"related_works":["https://openalex.org/W7101136643","https://openalex.org/W307523850","https://openalex.org/W1908579173","https://openalex.org/W763057062","https://openalex.org/W1989343205","https://openalex.org/W1992874513","https://openalex.org/W7131943242","https://openalex.org/W2065460337","https://openalex.org/W2779667494","https://openalex.org/W2080122513"],"abstract_inverted_index":{"In":[0,25,76,100],"dynamic":[1,28],"scheduling":[2],"arrival":[3,39,44],"times":[4],"as":[5,7,21,108,146,157,180],"well,":[6],"some":[8],"or":[9,23],"all":[10],"job":[11,36,43,105,169],"attributes":[12,106],"are":[13,82,119,215],"unknown":[14,32],"in":[15,51,65,137,217],"advance.":[16],"Dynamism":[17],"can":[18,45],"be":[19,46],"classified":[20],"partial":[22,189],"total.":[24],"simplest":[26],"partially":[27],"problems":[29,136],"the":[30,52,72,77,80,86,91,95,158,184,204],"only":[31],"attribute":[33],"of":[34,129,149,201,203,212],"a":[35,58,138,147,152,164,181,188,210],"is":[37],"its":[38,62],"time":[40,53,110],"rj.":[41],"A":[42],"given":[47],"at":[48,195],"any":[49],"instant":[50],"interval":[54],"between":[55],"zero":[56,85],"and":[57,115,131,173,207],"limit":[59],"established":[60],"by":[61,160,187,192],"processing":[63,109,171],"time,":[64,172],"order":[66,185],"to":[67,84,90],"ensure":[68],"finishing":[69],"it":[70],"before":[71],"due":[73,112,174],"date":[74,113],"deadline.":[75],"cases":[78],"where":[79],"arrivals":[81],"near":[83],"problem":[87,96],"becomes":[88,97],"closer":[89],"static":[92,166],"problem,":[93],"otherwise":[94],"more":[98],"restrictive.":[99],"totally":[101],"dynamics":[102],"problems,":[103],"other":[104],"such":[107],"pj,":[111],"dj,":[114],"tardiness":[116],"penalty":[117],"wj,":[118],"also":[120],"unknown.":[121],"This":[122],"paper":[123],"proposes":[124],"different":[125],"approaches":[126],"for":[127,163,209],"resolution":[128],"(partial":[130],"total)":[132],"Dynamic":[133],"Average":[134],"Tardiness":[135],"single":[139],"machine":[140],"environment.":[141],"The":[142,176,199],"first":[143],"approach":[144,178],"uses,":[145],"list":[148],"dispatching":[150,182],"priorities":[151],"final":[153],"(total)":[154],"schedule,":[155],"found":[156],"best":[159],"another":[161,193],"method":[162],"similar":[165],"problem:":[167],"same":[168],"features,":[170],"dates.":[175],"second":[177],"uses":[179],"priority":[183],"imposed":[186],"schedule":[190],"created":[191],"heuristic,":[194],"each":[196],"decision":[197],"point.":[198],"details":[200],"implementation":[202],"proposed":[205],"algorithms":[206],"results":[208],"group":[211],"selected":[213],"instances":[214],"discussed":[216],"this":[218],"work.":[219]},"counts_by_year":[{"year":2014,"cited_by_count":3}],"updated_date":"2026-10-08T09:06:37.294493","created_date":"2016-06-24T00:00:00"}