Multi-processor search and scheduling problems with setup cost

DOI10.1007/s00224-016-9691-3zbMath1368.68104OpenAlexW2472280164MaRDI QIDQ2398209

Alejandro López-Ortiz, Spyros Angelopoulos, Christoph Dürr, Diogo Arsénio

Publication date: 15 August 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-016-9691-3

zbMATH Keywords

linear programmingschedulinganytime algorithmsonline search

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14)

Related Items (2)

Best-of-both-worlds analysis of online search ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers

Cites Work

• Unnamed Item
• Infinite linear programming and online searching with turn cost
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane
• Optimal sequencing of contract algorithms
• The theory of search games and rendezvous.
• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Optimal scheduling of contract algorithms with soft deadlines
• Multi-target ray searching problems
• Online searching with turn cost
• On the linear search problem
• Yet more on the linear search problem
• A general search game
• Revisiting the Problem of Searching on a Line
• Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching
• The Oil Searching Problem
• Hyperbolic Dovetailing
• Minimax Solutions for Linear Search Problems
• Optimal Constructions of Hybrid Algorithms
• Competitive Search in Symmetric Trees
• The ultimate strategy to search on \(m\) rays?

This page was built for publication: Multi-processor search and scheduling problems with setup cost