{"id":"https://openalex.org/W2058900090","doi":"https://doi.org/10.1016/s0167-6377(02)00215-8","title":"Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem","display_name":"Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem","publication_year":2003,"publication_date":"2003-02-12","ids":{"openalex":"https://openalex.org/W2058900090","doi":"https://doi.org/10.1016/s0167-6377(02)00215-8","mag":"2058900090"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(02)00215-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00215-8","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-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/A5075438770","display_name":"Federico Della Croce","orcid":"https://orcid.org/0000-0003-2897-183X"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Polytechnic University of Turin","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"F. Della Croce","raw_affiliation_strings":["DAI, Politecnico di Torino, Corso Duca degli Abruzzi 24, Torino 10129, Italy"],"affiliations":[{"raw_affiliation_string":"DAI, Politecnico di Torino, Corso Duca degli Abruzzi 24, Torino 10129, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050636913","display_name":"Vincent t'Kindt","orcid":"https://orcid.org/0000-0002-7440-2980"},"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"V. T'kindt","raw_affiliation_strings":["E3I, Universit\u00e9 de Tours, 64 Avenue Jean Portalis, 37200 Tours, France","E3I, Universit\u00e9 de Tours, 64 Avenue Jean Portalis, 37200 Tours, France#TAB#"],"affiliations":[{"raw_affiliation_string":"E3I, Universit\u00e9 de Tours, 64 Avenue Jean Portalis, 37200 Tours, France","institution_ids":["https://openalex.org/I110017253"]},{"raw_affiliation_string":"E3I, Universit\u00e9 de Tours, 64 Avenue Jean Portalis, 37200 Tours, France#TAB#","institution_ids":["https://openalex.org/I110017253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075438770"],"corresponding_institution_ids":["https://openalex.org/I177477856"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":0.7738,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.76623007,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"2","first_page":"142","last_page":"148"},"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.992900013923645,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9861999750137329,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6927846670150757},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6412277817726135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6239438056945801},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5844330787658691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5276257395744324},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4923652410507202},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47696197032928467},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.459500789642334},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42039787769317627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3550250828266144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3102927803993225},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.07312586903572083},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06016847491264343}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6927846670150757},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6412277817726135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6239438056945801},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5844330787658691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5276257395744324},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4923652410507202},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47696197032928467},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.459500789642334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42039787769317627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3550250828266144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3102927803993225},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.07312586903572083},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06016847491264343},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0167-6377(02)00215-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(02)00215-8","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W81587953","https://openalex.org/W1965182192","https://openalex.org/W1969455357","https://openalex.org/W1977745207","https://openalex.org/W1979722828","https://openalex.org/W1988328380","https://openalex.org/W1989350769","https://openalex.org/W1997547289","https://openalex.org/W2002997223","https://openalex.org/W2008713008","https://openalex.org/W2024604250","https://openalex.org/W2025816555","https://openalex.org/W2026682089","https://openalex.org/W2042312329","https://openalex.org/W2069466073","https://openalex.org/W2576116471","https://openalex.org/W3018057494","https://openalex.org/W4302419487"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W2794663421","https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}