Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
315
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem
, 1998
"... In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality c ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality
A decomposition approach to the integrated vehicle-crew-rostering problem
"... A decomposition approach to the integrated vehicle-crew-rostering problem ..."
Abstract
- Add to MetaCart
A decomposition approach to the integrated vehicle-crew-rostering problem
A Bi-Criterion Approach for the Airlines Crew Rostering Problem
"... . In this communication a bi-criterion approach for the nominal Airlines Crew Rostering Problem is developed. The nominal Crew Rostering Problem considers the assignment of the crew staff to a set of pairings covering all the scheduled flights so that operations costs are minimized while its solu ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
. In this communication a bi-criterion approach for the nominal Airlines Crew Rostering Problem is developed. The nominal Crew Rostering Problem considers the assignment of the crew staff to a set of pairings covering all the scheduled flights so that operations costs are minimized while its
Efficient Multi-Skill Crew Rostering via Constrained Sets
- In Proceedings of the Second ILOG Solver and Scheduler Users Conference
, 1997
"... In this paper, we consider the Multi-skill Crew Rostering Problem. We propose a constraint programming approach based on constraint set variables. We prove that this approach yields an exponential factor improvement in the worst-case search space over the conventional constraint programming approach ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
In this paper, we consider the Multi-skill Crew Rostering Problem. We propose a constraint programming approach based on constraint set variables. We prove that this approach yields an exponential factor improvement in the worst-case search space over the conventional constraint programming
A Constraint Logic Programming Approach to the Crew Rostering Problem
"... In this paper, we present a constraint based approach to the Crew Rostering Problem. A solution to this problem is the optimal sequencing of a given set of duties into rosters in order to satisfy a set of constraints. The optimality criterion concerns the minimization of the number of crews neede ..."
Abstract
- Add to MetaCart
In this paper, we present a constraint based approach to the Crew Rostering Problem. A solution to this problem is the optimal sequencing of a given set of duties into rosters in order to satisfy a set of constraints. The optimality criterion concerns the minimization of the number of crews
© 2004 INFORMS A Multicommodity Flow Approach to the Crew Rostering Problem
, 2004
"... doi 10.1287/opre.1040.0110 ..."
Algorithms for Railway Crew Management
- In Liebling & de Werra [1997
, 1997
"... Abstract Crew management is concerned with building the work schedules of crews needed to cover a planned timetable. This is a well-known problem in Operations Research and has been historically associated with airlines and mass-transit companies. More recently, railway applications have also come ..."
Abstract
-
Cited by 31 (3 self)
- Add to MetaCart
on the scene, especially in Europe. In practice, the overall crew management problem is decomposed into two subproblems, called crew scheduling and crew rostering. In this paper, we g i v e an outline of di erent w ays of modeling the two subproblems and possible solution methods. Two main solution approaches
Solving Rostering Tasks as Constraint Optimization
, 2000
"... Based on experiences with the ORBISDienstplan-system [Mey97] -- a nurse rostering system that is currently used in about 30 German hospitals -- this paper describes how to use constraint processing for automatic rostering. In practice, nurse rostering problems have many varying parameters: Working ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
: Working time accounts, demands on crew attendance, set of used shifts, working time models, etc. Hence, rostering requires a flexible formalism for representing the variants of the problem as well as a robust search procedure that is able to cope with all problem instances. The described approach
† : Corresponding Author Rostering Ambulance Services
"... Abstract. This paper developed a model for rostering ambulance crew in order to maximise the coverage throughout a planning horizon and minimise the number of ambulance crew. Rostering Ambulance Services is a complex task, which considers a large number of conflicting rules related to various aspect ..."
Abstract
- Add to MetaCart
Abstract. This paper developed a model for rostering ambulance crew in order to maximise the coverage throughout a planning horizon and minimise the number of ambulance crew. Rostering Ambulance Services is a complex task, which considers a large number of conflicting rules related to various
Solving Rostering Tasks as Constraint Optimization
"... Abstract. Based on experiences with the ORBIS Dienstplan-system [12] – a nurse rostering system that is currently used in about 60 German hospitals – this paper describes how to use constraint processing for automatic rostering. In practice, nurse rostering problems have many varying parameters: Wo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
: Working time accounts, demands on crew attendance, set of used shifts, working time models, etc. Hence, rostering requires a flexible formalism for representing the variants of the problem as well as a robust search procedure that is able to cope with all problem instances. The described approach differs
Results 11 - 20
of
315
