MIT1_258JS10_lec19

MIT1_258JS10_lec19 - Outline • Crew Scheduling • Work...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Outline • Crew Scheduling • Work Rules and Policies • Manual Scheduling Process • Model Formulation • Automated Scheduling Experience Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 1 Crew Scheduling • Input • A set of vehicle blocks each starting with a pull-out and ending with a pull-in at the depot • Crew work rule constraints and pay provisions Objective: efine crew duties (aka runs days or shifts) covering all Define crew duties (aka runs, days, or shifts) covering all vehicle block time so as to: • minimize crew costs Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 2 Crew Scheduling Problem Constraints: • Work rules: hard constraints • Policies: preferences or soft constraints • Crews available: in short run the # of crews available are known ariations: Variations: • different crew types: full-time, part-time • mix restrictions: constraints on max # of part-timers Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 3 Crew Scheduling Problem Three-stage sequential approach: 1. Cutting long vehicle blocks into pieces of work 2. Combining pieces to form runs 3. Selection of minimum cost set of runs Manual process includes only steps 1 and 2; optimization process also involves step optimization process also involves step 3 Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 4 Typical Crew Scheduling Approach • Cutting Blocks: • each block consists of a sequence of vehicle revenue trips and non-revenue activities • blocks can be cut only at relief points where one crew can place another replace another. • relief points are typically at terminals which are accessible • void cuts within peak period avoid cuts within peak period • resulting pieces typically: ave minimum and maximum lengths have minimum and maximum lengths • should be combinable to form legal runs Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 5 Typical Crew Scheduling Approach for each vehicle block Definition: a partition of a block is the selection of a set of cuts each representing a relief Key problems: • very hard to evaluate a partition before forming runs • many partitions are possible for any vehicle block ossible Approaches: Possible Approaches: • generate only one partition for each vehicle block • enerate multiple partitions for each vehicle block generate multiple partitions • generate all possible partitions for each vehicle block Nigel Wilson 1.258J/11.541J/ESD.226J Spring 2010, Lecture 19 6 Vehicle Block Partitions Deadhead 6:40 7:00 a B d B 8:40 8:45 a B d B 10:30 10:40 a B d B 12:20 12:30 a B d B from Depot d A 5:45 6:00 a A d A 7:40 7:50 a A d A 9:35 9:45 a A d A 11:25 11:35...
View Full Document

This note was uploaded on 12/06/2011 for the course ESD 11.380j taught by Professor Fredsalvucci during the Fall '02 term at MIT.

Page1 / 23

MIT1_258JS10_lec19 - Outline • Crew Scheduling • Work...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online