Multi-processor search and scheduling problems with setup cost

DOI10.1007/S00224-016-9691-3MaRDI QIDQ2398209zbMATH OpenOpenAlexFDO

Authors Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro Lopez-Ortiz

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

anytime algorithmslinear programmingonline searchscheduling

Mathematics Subject Classification ID

Distributed systems (68M14) 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) Applications of mathematical programming (90C90)

Recommendations

• On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
• Further connections between contract-scheduling and ray-searching problems
• Optimal scheduling of contract algorithms for anytime problem-solving
• Multi-target ray searching problems
• Multi-target ray searching problems

Cites work

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

Cited in

(10)

• Further connections between contract-scheduling and ray-searching problems
• Optimal scheduling of contract algorithms for anytime problem-solving
• scientific article; zbMATH DE number 6678450 (Why is no real title available?)
• Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
• Search techniques for a nonlinear multiprocessor scheduling problem
• Multi-target ray searching problems
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Best-of-both-worlds analysis of online search
• Weighted online search
• Scheduling search procedures: The wheel of fortune

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398209)