{"id":"https://openalex.org/W2169713267","doi":"https://doi.org/10.1080/00207160211288","title":"Scheduling Equal-Length Jobs with Delivery times on Identical Processors","display_name":"Scheduling Equal-Length Jobs with Delivery times on Identical Processors","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2169713267","doi":"https://doi.org/10.1080/00207160211288","mag":"2169713267"},"language":"en","primary_location":{"id":"doi:10.1080/00207160211288","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211288","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5065182793","display_name":"Nodari Vakhania","orcid":"https://orcid.org/0000-0002-9013-9334"},"institutions":[{"id":"https://openalex.org/I884181516","display_name":"Universidad Aut\u00f3noma del Estado de Morelos","ror":"https://ror.org/03rzb4f20","country_code":"MX","type":"education","lineage":["https://openalex.org/I884181516"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Nodari Vakhania","raw_affiliation_strings":["Science Faculty , State University of Morelos , Av. Universidad 1001, Cuernavaca, Morelos, 62210; Mexico Inst. of Computational Math. , Akuri 8, Tbilisi 93, Georgia","Mexico Inst. of Computational Math. , Akuri 8, Tbilisi 93, Georgia","Science Faculty , State University of Morelos , Av. Universidad 1001, Cuernavaca, Morelos, 62210"],"affiliations":[{"raw_affiliation_string":"Science Faculty , State University of Morelos , Av. Universidad 1001, Cuernavaca, Morelos, 62210; Mexico Inst. of Computational Math. , Akuri 8, Tbilisi 93, Georgia","institution_ids":["https://openalex.org/I884181516"]},{"raw_affiliation_string":"Mexico Inst. of Computational Math. , Akuri 8, Tbilisi 93, Georgia","institution_ids":[]},{"raw_affiliation_string":"Science Faculty , State University of Morelos , Av. Universidad 1001, Cuernavaca, Morelos, 62210","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065182793"],"corresponding_institution_ids":["https://openalex.org/I884181516"],"apc_list":null,"apc_paid":null,"fwci":1.626,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85208753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"79","issue":"6","first_page":"715","last_page":"728"},"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.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9962000250816345,"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/combinatorics","display_name":"Combinatorics","score":0.6165602803230286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6027212738990784},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5290549993515015},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5144798755645752},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5093346834182739},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5074357390403748},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5051260590553284},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4784557819366455},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4150104522705078},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3616641163825989},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33356237411499023},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25908902287483215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2268517017364502},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08831870555877686},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.060432374477386475}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6165602803230286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6027212738990784},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5290549993515015},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5144798755645752},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5093346834182739},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5074357390403748},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5051260590553284},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4784557819366455},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4150104522705078},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3616641163825989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33356237411499023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25908902287483215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2268517017364502},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08831870555877686},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.060432374477386475},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160211288","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160211288","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6800000071525574,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1974776021","https://openalex.org/W2028826326","https://openalex.org/W2055849951","https://openalex.org/W2081140665","https://openalex.org/W2162658140","https://openalex.org/W2171210634"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2113623403","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W2018076478"],"abstract_inverted_index":{"The":[0,89],"problem":[1,83],"of":[2,6,68,81,119,139],"scheduling":[3],"n":[4,44],"jobs":[5],"equal":[7],"duration":[8],"p":[9],"with":[10,19,84],"release":[11],"and":[12],"delivery":[13,50,134],"times":[14],"on":[15,107,126,147],"m":[16,76],"identical":[17],"processors":[18],"the":[20,24,37,47,63,79,82,92,105,112,120,136,140],"objective":[21],"to":[22],"minimize":[23],"maximal":[25,48],"job":[26,49],"completion":[27],"time":[28,38,51,93,138],"is":[29,33,54,60],"considered.":[30],"An":[31],"algorithm":[32,90,121],"proposed":[34],"that":[35],"has":[36,91],"complexity":[39,94],"O":[40,69],"(":[41,70],"mn":[42,71],"log":[43],")":[45,103],"if":[46],"q":[52,86,108,127,148],"max":[53,87,109,128,149],"bounded":[55],"by":[56],"some":[57],"constant.":[58],"This":[59],"better":[61],"than":[62],"earlier":[64],"known":[65],"best":[66],"bound":[67],"2":[72],"log(":[73],"np":[74],"/":[75],"))":[77],"for":[78,131],"version":[80],"non-restricted":[85],".":[88,110,150],"O(q_{\\max":[95],"}^2":[96],"n\\log":[97],"n\\max":[98],"\\{":[99],"m,\\;q_{\\max":[100],"}":[101],"\\}":[102],"without":[104,124],"restriction":[106,125],"As":[111],"presented":[113],"computational":[114],"experiments":[115],"show,":[116],"practical":[117],"behavior":[118],"remains":[122],"good":[123],",":[129],"i.e.,":[130],"arbitrarily":[132],"long":[133],"times,":[135],"running":[137],"algorithm,":[141],"in":[142],"practice,":[143],"does":[144],"not":[145],"depend":[146]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}