Premium
Parametrized relocation of low‐mobility resources
Author(s) -
Wildstrom D. Jacob
Publication year - 2013
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21492
Subject(s) - relocation , schedule , computer science , inefficiency , mathematical optimization , service (business) , operations research , resource (disambiguation) , parametrization (atmospheric modeling) , mathematics , microeconomics , business , computer network , economics , physics , quantum mechanics , programming language , radiative transfer , operating system , marketing
Relocation of service‐providers in response to changing real‐time needs is suboptimal due to limited foreknowledge of client requests. Simple cost schedules for relocation and remote‐service provision have been investigated both for the possibility of complete optimizability and the degree of inefficiency introduced by imperfect future knowledge. This work further explores a parametrization developed for reflecting limitations in the mobility of some resources. The optimizability response to this parameter exhibits two significant thresholds. Below the first threshold, optimization is trivial, but many real‐world resource‐location problems correspond to parameter values past the second threshold. This work explores both the value of the second threshold and the behavior of optimal limited‐lookahead responses for resources whose immobility places them past this threshold. It is determined that, for resources of sufficiently high immobility α, it is possible with finite lookahead to achieve a relocation schedule which is within a ratio of (1+α) of the optimal omniscient schedule. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013