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...

the main objective of this study is to swing krull intersection theorem in primary decomposition of rings and modules to the primary decomposition of soft rings and soft modules. to fulfill this aim several notions like soft prime ideals, soft maximal ideals, soft primary ideals, and soft radical ideals are introduced for a soft ring over a given unitary commutative ring. consequently, the p...

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...

The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...

Architectural vulnerability factor (AVF) is the probability that a transient fault in a bit, gate, or transistor becomes a user-visible error. AVFs vary widely across time, applications, and bits. Usually AVFs averaged over time and across applications are used to compute the overall soft error rate of a processor. Average AVFs, however, cannot express the short-term vulnerability variations of...

Web Intelligence deals with the scientific research and development to explore the fundamental roles as well as practical impacts of soft computing and advanced intelligent paradigms for the next generation of Web-based systems, services, and environments. Chance discovery means discovering chances — the breaking points in systems, the marketing windows in business, etc. It involves determining...