In the airline crew scheduling problem a set of crew members must be assigned to a set of ights in such a way that all ights are covered at minimal cost, obeying governmental and airline specic rules and regulations. Traditionally, the problem is decomposed into pairing and rostering which

. We give an overview of the parallelization work done in PAROS. The specific parallelization objective has been to improve the speed of airline crew scheduling, on a network of workstations. The work is based on the Carmen System, which is used by most European airlines for this task. We give a

Airline crew scheduling algorithms widely used in practice assume no disruptions. Since disruptions often occur, the actual cost of the resulting crew schedules is often significantly greater. We consider algorithms for finding crew schedules that perform well in practice. The deterministic crew

Abstract not found

Abstract — Indian Railways is the world's ninth largest commercial or utility employer, by number of employees, with over 1.4 million employees. Indian Railways (reporting mark IR) is an Indian state-owned enterprise, owned and operated by the government of India through the Ministry of Railways. Our Railways were first introduced to India in 1853 from Bombay to Thane. Indian Railways is the golden era to our nation. RUNNING ROOM is a railway project which aims “To allocate the beds for the loco Pilots (LP’s), Assistant Loco Pilots (ALP’s) and Guards in the running room of all divisions. It is also used to display the allocated beds of different sections through online”, is using J2EE technology. The project maintains the registers of the LP’s, ALP’s, Guards those who are traveling between different sections and to know the timings of Loco Pilots. In this the Loco-Pilot and Assistant-Pilots will take rest after traveling to a particular distance for a specified time. The LP/ALP must register into the book by giving the details like his name, incoming train no, outgoing date, outgoing train no, room which is allocated, room departure time and also along with his designation and head quarters. It is also called bed occupation register. In this project if the bed is filled it will be indicated with a particular color. By this we can get the remaining number of beds so that we can allocate for the other pilots all this information must be provided through online. When a pilot register in the login form and enter his details like username, password he will redirect to the bed occupation register. While entering to the designation and some other details the particular room number and the bed number will be allocated to the LP/ALP. The process will be easy, comparing to the present situation, which is done as paper work.

modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of metaheuristics, in particular GRASP, tabu search and genetic algorithm to solve the bus-driver-scheduling problem. The metaheuristics have been successfully incorporated in the GIST Planning

Performance aspects of a Lagrangian relaxation based heuristic for solving large 0-1 integer linear programs are discussed. In particular, we look at its application to airline and railway crew scheduling problems. We present a scalable parallelization of the original algorithm used in production

In airline traffic disruptions occur frequently and cannot be totally avoided. They may lead to infeasible aircraft and crew schedules during the day of op-erations, due to absence of resources or violation of crew rules. The process of finding new schedules in such cases is called recovery

Airways that can be used to provide a solution to the airline's crew scheduling problem whose quality was comparable with the manual solutions generated by human experts on this particular problem. In addition to this the system should also constitute a tool with which its operators could

: A Potts feedback neural network approach for finding good solutions to resource allocation problems with a non-fixed topology is presented. As a target application the airline crew scheduling problem is chosen. The topological complication is handled by means of a propagator defined in terms