{"id":"https://openalex.org/W2088810648","doi":"https://doi.org/10.1007/s00453-006-0193-6","title":"Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching","display_name":"Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching","publication_year":2007,"publication_date":"2007-03-01","ids":{"openalex":"https://openalex.org/W2088810648","doi":"https://doi.org/10.1007/s00453-006-0193-6","mag":"2088810648"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-006-0193-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-006-0193-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5049804650","display_name":"Nir Avrahami","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Nir Avrahami","raw_affiliation_strings":["Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","Department of Computer Science, Tel Aviv University, Tel-Aviv, 69978, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Computer Science, Tel Aviv University, Tel-Aviv, 69978, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","Department of Computer Science, Tel Aviv University, Tel-Aviv, 69978, Israel#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Department of Computer Science, Tel Aviv University, Tel-Aviv, 69978, Israel#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049804650"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.3533,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.8314046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"47","issue":"3","first_page":"253","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9986000061035156,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9937999844551086,"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/preemption","display_name":"Preemption","score":0.7858517169952393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7367312908172607},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6219428181648254},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6106913089752197},{"id":"https://openalex.org/keywords/interrupt","display_name":"Interrupt","score":0.602074146270752},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5685896277427673},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5602676868438721},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5160674452781677},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4857978820800781},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.42930132150650024},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42921650409698486},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41576844453811646},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.41233164072036743},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3724026679992676},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.365680992603302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30564773082733154},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.19656795263290405},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18561971187591553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15278497338294983},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.1043519377708435}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7858517169952393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7367312908172607},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6219428181648254},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6106913089752197},{"id":"https://openalex.org/C41661131","wikidata":"https://www.wikidata.org/wiki/Q220764","display_name":"Interrupt","level":3,"score":0.602074146270752},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5685896277427673},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5602676868438721},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5160674452781677},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4857978820800781},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.42930132150650024},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42921650409698486},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41576844453811646},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.41233164072036743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3724026679992676},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.365680992603302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30564773082733154},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.19656795263290405},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18561971187591553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15278497338294983},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.1043519377708435},{"id":"https://openalex.org/C173018170","wikidata":"https://www.wikidata.org/wiki/Q165678","display_name":"Microcontroller","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":1,"locations":[{"id":"doi:10.1007/s00453-006-0193-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-006-0193-6","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1531908439","https://openalex.org/W1537316992","https://openalex.org/W1585522101","https://openalex.org/W1903284337","https://openalex.org/W2008147296","https://openalex.org/W2009844010","https://openalex.org/W2013170874","https://openalex.org/W2042312329","https://openalex.org/W2047150311","https://openalex.org/W2056273707","https://openalex.org/W2058225986","https://openalex.org/W2074109829","https://openalex.org/W2085325317","https://openalex.org/W2086365412","https://openalex.org/W2576116471"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W2058359717","https://openalex.org/W3135987664","https://openalex.org/W186360080","https://openalex.org/W2051209951","https://openalex.org/W1493790977","https://openalex.org/W2593588471","https://openalex.org/W1984292487","https://openalex.org/W2147409235","https://openalex.org/W4230481261"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}