{"id":"https://openalex.org/W2136687547","doi":"https://doi.org/10.1080/00207169108803998","title":"Some results of the relocation problems with processing times and deadlines","display_name":"Some results of the relocation problems with processing times and deadlines","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W2136687547","doi":"https://doi.org/10.1080/00207169108803998","mag":"2136687547"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108803998","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803998","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/A5024663066","display_name":"Miao-Tsong Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Miao-Tsong Lin","raw_affiliation_strings":["Institute of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, R.O.C, 30050, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science and Information Engineering , National Chiao Tung University , Hsinchu, R.O.C, 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015331019","display_name":"Shian-Shyong Tseng","orcid":"https://orcid.org/0000-0003-0760-5224"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shian-Shyong Tseng","raw_affiliation_strings":["Institute of Computer and Information Science , National Chiao Tung University , Hsinchu, R.O.C, 30050, Taiwan"],"affiliations":[{"raw_affiliation_string":"Institute of Computer and Information Science , National Chiao Tung University , Hsinchu, R.O.C, 30050, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024663066"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":2.2636,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88782263,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"40","issue":"1-2","first_page":"1","last_page":"15"},"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9973000288009644,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9932000041007996,"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/relocation","display_name":"Relocation","score":0.9822330474853516},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6191422939300537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5538408756256104},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.550606906414032},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43772587180137634},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4070093035697937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3166244924068451},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30058735609054565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2752031683921814},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11924988031387329}],"concepts":[{"id":"https://openalex.org/C2779019381","wikidata":"https://www.wikidata.org/wiki/Q3499564","display_name":"Relocation","level":2,"score":0.9822330474853516},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6191422939300537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5538408756256104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.550606906414032},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43772587180137634},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4070093035697937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3166244924068451},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30058735609054565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2752031683921814},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11924988031387329}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169108803998","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803998","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1969298635","https://openalex.org/W1986022261","https://openalex.org/W2001364911","https://openalex.org/W2003277860","https://openalex.org/W2011039300","https://openalex.org/W2024384597","https://openalex.org/W2024742034","https://openalex.org/W2040684074","https://openalex.org/W2063626041","https://openalex.org/W4247412896"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857","https://openalex.org/W2521054645","https://openalex.org/W2113270940"],"abstract_inverted_index":{"The":[0,34],"relocation":[1,35,81],"problem":[2,36,82,111],"originates":[3],"from":[4],"the":[5,13,40,46,55,71,80,125],"public":[6],"housing":[7],"project":[8],"so":[9],"as":[10],"to":[11,38,130],"minimize":[12],"budgets.":[14],"Given":[15],"a":[16,96],"set":[17,51],"of":[18,24,32,49,52,73,104,106,109],"jobs":[19],"each":[20,90],"demands":[21],"nt":[22],"units":[23,31],"resources":[25],"for":[26],"processing":[27,84,97],"and":[28,66,86,99,124],"returns":[29],"a,":[30],"resources.":[33],"is":[37,70,92],"determine":[39],"minimum":[41],"resource":[42],"requirements":[43],"demanded":[44],"by":[45,64],"successful":[47],"completion":[48],"this":[50,76,110],"jobs.":[53,74],"In":[54,75],"literature,":[56],"an":[57,100],"O(h\u2217log":[58],"h)":[59],"algorithm":[60],"has":[61],"been":[62],"proposed":[63],"Kaplan":[65],"Amir,":[67],"where":[68],"h":[69],"number":[72],"paper,":[77],"we":[78,115],"consider":[79],"with":[83,95],"times":[85],"deadlines":[87],"in":[88,127],"which":[89],"job":[91],"additionally":[93],"associated":[94],"length":[98],"individual":[101],"deadline.":[102],"Studies":[103],"NP-completeness":[105],"some":[107,132],"versions":[108],"are":[112],"included.":[113],"Also,":[114],"propose":[116],"two":[117],"polynomial":[118],"algorithms,":[119],"one":[120],"runs":[121],"inO(h\u2217log":[122],"h)time":[123],"other":[126],"O(h2\u2217log":[128],"h)time,":[129],"solve":[131],"further":[133],"restricted":[134],"problems.":[135]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}