Loading [MathJax]/extensions/MathZoom.js
In this paper we consider the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan. This problem is known to be x1d4a9;x1d4ab; -hard in the strong sense. We propose an algorithm based on a branch and bound enumeration scheme. This algorithm includes the implementation of new lower and upper bound procedures, and dominance rules. A computer simulation to measure the performance of the algorithm is provided for a wide...
This paper deals with a special case of Project Scheduling problem: there is a project to schedule, which is made up of activities linked by precedence relations. Each activity requires specific skills to be done. Moreover, resources are staff members who master fixed skill(s). Thus, each resource requirement of an activity corresponds to the number of persons doing the corresponding skill that must be assigned to the activity during its whole processing time. We search for an exact solution that...
This paper is devoted to the exact resolution of a strongly NP-hard resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance,...
In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical one...
In this paper, a new schedule generation scheme for
resource-constrained project scheduling problems is proposed. Given a
project scheduling problem and a priority rule, a schedule generation
scheme determines a single feasible solution by inserting one by one
each activity, according to their priority, inside a partial
schedule. The paper proposes a generation scheme that differs from the
classic ones in the fact that it allows to consider the activities in
any order, whether their predecessors...
We give a new formulation for the problem of task scheduling into
unrelated processors under precedence constraints. This formulation
has a polynomial number of variables and does not require that the
processing times be integer valued.
Currently displaying 1 –
20 of
234