Amir Elalouf

Learn More
Camponogara and Shima (2010) developed an ε-approximation algorithm (FPTAS) for the mobile agent routing problem in which a benefit function determines how visits to different sites contribute to the agent’s mission. The benefit is to be maximized under a time constraint. They reduced the problem to the constrained longest-path problem in a graph. In this(More)
The aim of this paper is to develop an improved polynomial-time approximation algorithm belonging to the family of the fully polynomial time approximation schemes (FPTAS), for an ancient scheduling problem with deadlines. The algorithm permits to answer a question posed more than three decades ago in Gens & Levner (1981): “Can an(More)
A basic problem in the quality-of-service (QoS) analysis of multiagent distributed systems is to find optimal routes for the mobile agents that incrementally fuse the data as they visit hosts in the distributed system. The system is modeled as a directed acyclic graph in which the nodes represent hosts and the edges represent links between them. Each edge(More)
This paper proposes a model and a corresponding scheduling algorithmic approach to reduce crowding in an emergency department (ED), and to provide patients with faster and better service. This approach relies on the ”Floating Patients” (FP) method, in which the ED triage can send some patients directly to hospitalization departments instead of providing(More)