Solving the Stochastic Time-Dependent Orienteering Problem with Time Windows

This paper introduces the stochastic time-dependent orienteering problem with time windows. The orienteering problem occurs in logistic situations where an optimal combination of locations must first be selected and then the routing between these selected locations must be optimized. In the stochastic time-dependent variant, the travel time between two locations is a stochastic function that depends on the departure time at the first location. The main contribution of this paper lies in the design of a fast and eective algorithm to solve this challenging problem. To validate the performance and the practical relevance of this proposed algorithm, several experiments were carried out on realistic benchmark instances of varying size and properties. These benchmark instances are constructed based on an actual large road network in Belgium with historic travel time profiles for every road segment.publisher: Elsevier articletitle: Solving the stochastic time-dependent orienteering problem with time windows journaltitle: European Journal of Operational Research articlelink: http://dx.doi.org/10.1016/j.ejor.2016.05.031 content_type: article copyright: © 2016 Elsevier B.V. All rights reserved.status: publishe

Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan

Most of the papers that deal with the two-machine flow shop problem assume that the machines are always available during the scheduling period. However, in most real life industrial settings a machine can be unavailable for many reasons. This paper is concerned with the problem of jointly scheduling n immediately available jobs and the preventive maintenance in a two-machine flow shop with the objective of minimizing the makespan. We consider that one of the two machines must be maintained once during the first T periods of the schedule. Only the non-resumable case is studied. We first focus on the particularity of this problem. After we present some properties of the optimal solution then we show that the problem is NP-hard. We last focus on the optimal solutions under some conditions.

A Metaheuristic Solution Approach for the Time-constrained Project Scheduling Problem

In this paper, a metaheuristic solution procedure for the Time-Constrained Project Scheduling Problem is proposed, in which additional resources can be temporarily allocated to meet a given deadline. The problem consists of determining a schedule such that the project is completed on time and that the total additional cost for the resources is minimized. For this problem, an artificial immune system is proposed, in which each solution is represented by a vector of activity start times. A local search procedure, which tries to shift cost causing activities, is applied to each population schedule. Computational experiments are applied to modified resource-constrained project scheduling problem benchmark instances and reveal promising results.status: publishe