The railway crew scheduling problem consists of finding the most efficient duty combination
for railway crews to cover all trains and related activities for a defined period of time. Crew …

Computational methods for rostering and personnel scheduling has been a subject of
continued research and commercial interest since the 1950s. This annotated bibliography …

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …

Given a set of jobs and a set of workers, the generic problem we consider is to find a
partition of the jobs into subsets so that each job is contained in exactly one subset, and …

The airline industry is faced with some of the largest scheduling problems of any industry.
The crew scheduling problem involves the optimal allocation of crews to flights. Over the last …

The railway crew scheduling problem consists of generating crew duties to operate trains at
minimal cost, while meeting all work regulations and operational requirements. Typically, a …

The daily crew pairing problem (DCPP) seeks to generate a set of minimal-cost pairings that
covers all the planned daily flights while complying with a variety of labor regulations, safety …

The use of LAN‐based clusters of computers for computational purposes has been in use for
several years with significant success and acceptability. The introduction of the Internet …

This paper proposes a multi-start randomized heuristic for solving real-life crew rostering
problems in airlines. The paper describes realistic constrains, regulations, and rules that …

Airline schedule planning problems are typically decomposed into smaller problems, which
are solved in a sequential manner, due to the complexity of the overall problems. This …