Crew scheduling

<h2 id="complex">Complex</h2>
<p>Most transportation systems use software to manage the crew scheduling process. Crew scheduling becomes more and more complex as you add variables to the problem. These variables can be as simple as 1 location, 1 skill requirement, 1 shift of work and 1 set roster of people.  In the Transportation industries, such as Rail or mainly Air Travel, these variables become very complex. In Air Travel for instance, there are numerous rules or "constraints" that are introduced.  These mainly deal with legalities relating to work shifts and time, and a crew member's qualifications for working on a particular aircraft. Add numerous locations to the equation and Collective Bargaining and Federal labor laws and these become new considerations for the problem solving method.  Fuel is also a major consideration as aircraft and other vehicles require a lot of costly fuel to operate. Finding the most efficient route and staffing it with properly qualified personnel is a critical financial consideration. The same applies to rail travel. Crew scheduling involves assigning complementary crews for each scheduled trip based on the timetable for the next day or a short period.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> In rail transportation, crew scheduling involves generating crew duties for conductors and train operators.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a>
</p><p>The problem is computationally difficult and there are competing mathematical methods of solving the problem. Although not easy to describe in one sentence, the goal is essentially the same for any method of attacking the problem: 
"Within a set of constraints and rules, move a set roster of people with certain qualifications, from place to place with the fewest personnel and aircraft or vehicles in the least amount of time." Lowest cost has traditionally been the major driver for any crew scheduling solution.
</p>
<h2 id="four-parts">Four Parts</h2>
<p>Although not a "rule", We can describe  at least four parts of the equation that are ingested by the computational process:
</p>
<ul><li>People and their qualifications and abilities.</li>
<li>Aircraft or vehicles and their "People" qualification requirements and their cost to operate over distance.</li>
<li>Locations and the time and distance between each location.</li>
<li>Work rules for the personnel, including Shift hours and seniority.</li></ul>
<p>In crew scheduling the rules and constraints are typically a combination of:
</p>
<ul><li>government regulations concerning flight time, duty time and required rest, designed to promote <a href="/facts/Aviation_safety/tFTm3S2p">aviation safety</a> and limit <a href="/facts/Pilot_fatigue/ohUd0Cz2">pilot fatigue</a>,</li>
<li>crew bid requests, vacations,</li>
<li>labor agreements</li>
<li><a href="/facts/Aircraft_maintenance/RET3klG4">aircraft maintenance</a> schedules</li>
<li>crew member qualification and licensing</li>
<li>other constraints related to training</li>
<li>pairing experienced crew members with more junior crew members</li>
<li>returning crew to their base at the end of their trip (called <a href="/facts/Deadheading_(aviation)/S3RoTsrd">deadheading</a>)</li></ul>
<p>The first phase in crew planning is building the crew pairings (also known as trips, rotations, among other popular descriptions).  This process pairs a generic crew member with a flight so that at the end of this process all aircraft flights are covered and all trips (combination of flights starting at a crew base and returning to that crew base or co-terminal are crew legal.  The next step is the allocation of those trips to the individual crewmember. 
</p><p>For the US, Canada and Australia, seniority generally rules.  The two processes (which are completely different) are referred to as bid lines and preferential bidding.  In seniority order, pilots bid for either a line of time (bidline) or trips and days off (preferential bidding.  These are awarded based on seniority and modified only when their selections have already been taken by a more senior crew member (bidlines) or their trip and day off selections (preferential bidding) do not make up a complete line (hours, days off, etc. parameters agreed to by the company and the union).  The senior folks have more time off, better choice of time off and fly better trips than the junior crew members, generally speaking. In the US, this is considered fair. 
</p><p>For European airlines and other airlines in the rest of the world, the allocation process is completely different.  The company builds the pilot schedules directly to meet their needs, not the pilot's needs.  Before assigning a single trip, the schedulers put all planned absences (vacation, training, etc.) onto the crew members' schedule.  Only then are trips assigned to the individual crew members.  As such, fairness means that the most senior captain and the most junior captain have the same amount of duty time, block hours, night time, time away from base, layovers, expense pay, etc. in a given schedule period.  Seniority is out and all work is completely homogenized.  For them, anything else is unfair, undemocratic. Slowly over the last thirty years, foreign airlines using the "no seniority" rostering system have allowed some measure of seniority to creep into the allocation process from pilots who may now ask for a specific day off or trip once a quarter or make multiple requests within a schedule period.  Although this may sound very much like preferential bidding, it is not.  The disparity between junior and senior crew members is still very limited and thus achievement of your choices is limited.
</p>
<h2 id="disruptions">Disruptions</h2>
<p>Additional unplanned disruptions in schedules due to weather, maintenance, and <a href="/facts/Air_traffic_control/G2cQebVb">air traffic control</a> delays can disrupt schedules, so crew scheduling software remains an area for ongoing research.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a>
</p>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Automated_planning_and_scheduling/VL1TcrmD">Automated planning and scheduling</a></li>
<li><a href="/facts/Column_generation/3T355xua">Column generation</a></li>
<li><a href="/facts/Driver_scheduling_problem/NmUHcXhL">Driver scheduling problem</a></li>
<li><a href="/facts/Fatigue_Avoidance_Scheduling_Tool/U0Haz7Wk">Fatigue Avoidance Scheduling Tool</a></li>
<li><a href="/facts/Fatigue_(safety)/55w6Lx0y">Fatigue (safety)</a></li>
<li><a href="/facts/Linear_programming/GduXFQxT">Linear programming</a></li>
<li><a href="/facts/Preferential_bidding_system/SXQdSRzP">Preferential bidding system</a></li>
<li><a href="/facts/Tabu_search/olw8qTSl">Tabu search</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li>Alex Osleger (January 17, 2019). <a href="https://airwaysmag.com/industry/solving-the-nightmare-of-crew-scheduling/">"Solving The Nightmare Of Crew Scheduling"</a>. <i>Airways Mag</i>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Pang, Shinsiong (5 April 2023). "Optimize railway crew scheduling by using modified bacterial foraging algorithm". Computers & Industrial Engineering. 180 (180): 109218. doi:10.1016/j.cie.2023.109218. S2CID 257990456. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>Pang, S., & Chen, M. C. (2023). Optimize railway crew scheduling by using modified bacterial foraging algorithm. Computers & Industrial Engineering, 180, 109218. <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>Pang, Shinsiong; Chen, Mu-Chen (June 2023). "Optimize railway crew scheduling by using modified bacterial foraging algorithm". Computers & Industrial Engineering. 180: 109218. doi:10.1016/j.cie.2023.109218. ISSN 0360-8352. <a href="https://dx.doi.org/10.1016/j.cie.2023.109218" target="_blank">https://dx.doi.org/10.1016/j.cie.2023.109218</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>http://www.engr.pitt.edu/~schaefer/Papers/UncertainCrewSched.pdf Archived 2007-06-12 at the Wayback Machine "Airline crew Scheduling under Uncertainty" <a href="http://www.engr.pitt.edu/~schaefer/Papers/UncertainCrewSched.pdf" target="_blank">http://www.engr.pitt.edu/~schaefer/Papers/UncertainCrewSched.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
</ol>

Crew scheduling open-in-new

Crew scheduling