In this article we consider the Rural Postman Problem with Time Windows (RPPTW) for the undirected case. The problem occurs in the monitoring of roads for black-ice detection. We give different formulations and compare them on sets of instances adapted from the literature. We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem wi...

Due to Windows NT’s widespread acceptance on desktops in business and industry, it is also being considered for use in real-time systems. The fact that Windows NT is a general-purpose operating system complicates its application into a real-time environment. We have performed an extensive performance evaluation of Windows NT to determine if we can use it in the development of future real-time s...

This study determines the major difference between rumors and non-rumors and explores rumor classification performance levels over varying time windows-from the first three days to nearly two months. A comprehensive set of user, structural, linguistic, and temporal features was examined and their relative strength was compared from near-complete date of Twitter. Our contribution is at providing...

Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T , find an s-t walk of total length at most T that maximizes the number of distinct nodes visited by the walk. One obtains a generalization, namely orienteering with time-windows (also referred to as TSP with time-windows), if each node v has a specified ti...

In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several customer locations. Two mixed integer linear programming formulations are presented for this problem: a classical arc flow model and a sequential assignment model. Several polyhedral results are provided for the second f...

Advanced Planning and Scheduling systems (APS) are intensively utilized in the industry, namely because they allow generating and analyzing planning scenarios very quickly. They are not well suited for make-to-order situations since due dates are not considered hard constraints to be fulfilled. Processing time windows allow to take into account due dates in the development of APS enhanced heuri...

A proper understanding of human performance characteristics is a prerequisite for designers of complex systems. Although human factors texts provide some insights into basic performance issues, the emergence of highly automated computing systems have fundamentally altered the way humans work. The purpose of this article is to present a research approach to quantify and analyze human performance...

This work investigates allocation of tasks to multi-robots when tasks are spatially distributed and constrained to be executed within assigned time windows. Our work explores the interaction between scheduling and optimal routing. We propose the Time-Sensitive Sequential Single-Item Auction algorithm as a method to allocate tasks with time windows in multi-robot systems. We show, experimentally...

Most operating system schedulers are not flexible enough to support dynamic scheduling policies like earliest deadline first and least slack algorithms. Some of these algorithms are widely used in real-time applications. This paper looks into the issues involved in developing a real-time scheduler for a general purpose operating system. We describe the implementation of a user-level threads pac...

The Traveling Salesman Problem with Time Windows (TSPTW) is the problem of finding a minimum-cost path visiting a set of cities exactly once, where each city must be visited within a given time window. We present an extended formulation for the problem based on partitioning the time windows into sub-windows, which we call buckets. We present cutting planes for this formulation that are computat...