On-line algorithms for the dynamic traveling repair problem
From MaRDI portal
Publication:2464421
DOI10.1023/B:JOSH.0000019683.85186.57zbMath1154.90461OpenAlexW3139501620MaRDI QIDQ2464421
Sandy Irani, Xiangwen Lu, Amelia C. Regan
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:josh.0000019683.85186.57
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (10)
Maintenance scheduling of geographically distributed assets with prognostics information ⋮ Orienteering problem with time-windows and updating delay ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Competitive analysis of a dispatch policy for a dynamic multi-period routing problem ⋮ New policies for the dynamic traveling salesman problem ⋮ How to whack moles ⋮ An adversarial queueing model for online server routing ⋮ Online decision making and automatic decision model adaptation ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Online traveling salesman problem with time cost and non-zealous server
This page was built for publication: On-line algorithms for the dynamic traveling repair problem