Scheduling Status Updates from a Sensor to Minimize the Age of Information at the Destination

Date

2017-12-30

Author

Uysal, Elif

Metadata

Show full item record

Item Usage Stats

48
views

0
downloads

URI

http://materials.dagstuhl.de/index.php?semnr=17271
https://hdl.handle.net/11511/88040

Collections

Unverified, Conference / Seminar

Suggestions

OpenMETU
Core

Scheduling Status Updates to Minimize Age of Information with an Energy Harvesting Sensor Bacınoğlu, Baran Tan; Uysal, Elif (2017-06-30) Age of Information is a measure of the freshness of status updates in monitoring applications and update-based systems. We study a real-time sensing scenario with a sensor which is restricted by time-varying energy constraints and battery limitations. The sensor sends updates over a packet erasure channel with no feedback. The problem of finding an age-optimal threshold policy, with the transmission threshold being a function of the energy state and the estimated current age, is formulated. The average age ...
Scheduling preventive maintenance on a single CNC machine Gürel, Sinan (2008-01-01) In this study we attempt to deal with process planning, scheduling and preventive maintenance (PM) decisions, simultaneously. The objective is to minimize the total completion time of a set of jobs on a CNC machine. During the process planning, we decide on the processing times of the jobs which are controllable (i.e. they can be easily changed) on CNC machines. Using shorter processing times (higher production rates) would result in greater deterioration of the machine, and we would need to plan more frequ...
Scheduling jobs on unrelated parallel machines to minimize regular total cost functions Azizoğlu, Meral; Kirca, O (1999-02-01) In this paper we consider unrelated parallel machine scheduling problems that involve the minimization of regular total cost functions. We first present some properties of optimal solutions and then provide a lower bound. These mechanisms are tested on the well-known practical problem of minimizing total weighted flow time on unrelated parallel machines. In doing so, we design a branch and bound algorithm incorporating the mechanisms derived for the general total cost function along with the ones derived sp...
Scheduling a dual gripper material handling robot with energy considerations Gürel, Sinan; Gultekin, Hakan; Emiroglu, Nurdan (2023-04-01) Robotic cells are serial production systems that consist of a number of machines and a material handling robot that transfers parts between the machines. Energy consumption of a robot during its move between two machines can be decreased by carefully selecting its speed. This paper presents models and algorithms that make robot speed and robot activity sequencing decisions together for a dual-gripper robot that can handle two parts simultaneously. We consider both robot energy consumption and cycle time obj...
Scheduling job families about an unrestricted common due date on a single machine Azizoğlu, Meral (1997-01-01) We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due date to minimize total weighted earliness and tardiness cost. Jobs are grouped into families where jobs in the same family share a setup; a setup time is required between the processing of two jobs from different families. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. These rates are assessed on a per-period basis when the completion time deviates from its ...

Citation Formats

E. Uysal, “Scheduling Status Updates from a Sensor to Minimize the Age of Information at the Destination,” 2017, Accessed: 00, 2021. [Online]. Available: http://materials.dagstuhl.de/index.php?semnr=17271.