A Linear Programming Formulation of Crew Assignment Problems Using Hungarian Method

2020 jecet  
This paper aims on showing one of the many ways that flight crewmembers can be assigned flight legs to and from their home base; this known as the Crew Assignment problem. The paper aims to minimize the lay-over time of crew members at the when they are not in their home town and maximize their time in their home town using a type of Linear Programming Model known as the Hungarian Algorithm. The results of this algorithm can confirmed using any other LP model.
doi:10.24214/jecet.c.9.3.45966 fatcat:qtrtajkvcrbhvjmkdtmnuigf7y