Search results for "scheduling."

Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm

2014

We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…

A hybrid genetic algorithm for the resource-constrained project scheduling problem

2008

Abstract In this paper we propose a Hybrid Genetic Algorithm (HGA) for the Resource-Constrained Project Scheduling Problem (RCPSP). HGA introduces several changes in the GA paradigm: a crossover operator specific for the RCPSP; a local improvement operator that is applied to all generated schedules; a new way to select the parents to be combined; and a two-phase strategy by which the second phase re-starts the evolution from a neighbour’s population of the best schedule found in the first phase. The computational results show that HGA is a fast and high quality algorithm that outperforms all state-of-the-art algorithms for the RCPSP known by the authors of this paper for the instance sets j…

SCHEDULING MULTIMODAL TRANSPORTATION SYSTEM FOR COMMUTERS

2004

Vehicle scheduling for rental-with-driver services

2021

Abstract In this paper, we introduce a new vehicle scheduling problem (VSP) with driver consistency faced by rental-with-driver companies. A weekly time-horizon is considered and a set of potential customers, each one associated with a list of required tasks, is assumed. The company can choose to accept or reject a customer, but if accepted, all required tasks must be performed by the same driver. A profit is associated with each customer. The goal is to maximize the company’s total profit, by respecting a list of daily and the weekly drivers’ workload limitations imposed by drivers’ contracts. We propose a mathematical formulation of the problem and design an exact solution method based on…

Skilled workforce scheduling in Service Centres

2009

Abstract The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centres (SC). The SWPSP considers many real characteristics faced daily by the SC: client-company service quality agreements that establish maximum dates for the beginning and the end of tasks with penalties for delays, criticality levels indicating the client-priority in processing each task, generalized precedence relationships that can produce cycle structures, time period and percentage time lags and variable task durations depending on the worker executing the task. Furthermore, the SC workforce i…

Agro-hydrological models to schedule irrigation of Mediterranean tree crops

2010

In this paper a comparison between two agro-hydrological models, used to schedule irrigation of typical Mediterranean tree crops, is assessed. In particular the comparison between the model proposed by FAO, using a black box processes schematization, and the SWAP model based on the numerical analysis of Richards’ equation is initially presented for two irrigation seasons, 2005 and 2006, and two Mediterranean tree crops, i.e. grapevine (Vitis vinifera, L.) and olive oil (Olea europea, L.). The comparison mainly focuses on hydrological balance components and on soil water contents. After investigating and setting the scheduling parameters ordinarily practiced by the framers in the area (i.e o…

Assessing agro-hydrological models to schedule irrigation for crops of Mediterranean Environment

2008

A Non-Parametric Parallel Harris-Affine Detector

2009

This paper describes a parallel version of a new automatic Harris-based corner detector. A simple but effective client-server based scheduler has been implemented in order to dynamically distribute the workload on heterogeneous parallel architectures such as Grid systems. Results obtained on the COMETA Grid show the effectiveness and the robustness of the proposed approach.

A Harris-based Region Detector on a Computational Grid

2007

This paper introduces a new Harris-based feature detector algorithm, characterized by no parameters tuning to detect region of interest. Preliminary results show that the proposed methodology returns good results with respect to standard detectors which need a set of parameters. An uncommon parallel implementation of the proposed algorithm is presented to support the high computational workload which is required to avoid the approximation of the results. Our parallel approach differs from the conventional one because an internal scheduler, based on the expected running time, is used to balance the data distribution on a client-server model. The aim of this paper is also to underline the adv…

Maintenance Planning For The Reliability Maximization In A Large System With Vagueness In The Reliability Values Of Some Components

2015

This paper tackles the problem to single out the maintenance actions to be executed on a production system during the planned stop of given length. In detail, from a reliability viewpoint the system is assimilated as a series-parallel multi-component system and the maintenance actions need to maximize the system reliability up to the next planned stop. Moreover, it is assumed that some components reliability values are affected by vagueness within a given range. To solve the considered problem, an exact dynamic programming algorithm suitable to quickly point out the maintenance scheduling is developed and, moreover, it is formulated a proper parameter able to express the robustness of the o…