Routing: Planning (Sequencing and Scheduling) Flashcards
Define planning/Loading, scheduling and controlling.
Planning: Determining what must be done and which activities precede others.
Scheduling: Determining when the tasks must be completed.
Controlling: Analyses and applied corrections to the difference between scheduled and actual performance.
List the four planning and controlling activities.
- Scheduling (When to do it?)
- Sequencing (In what order?)
- Loading (What to do?)
- Monitoring and control (Is it going according to plan?)
What is the goal of planning?
To have smooth operations.
Give an example of a complex problem that makes it difficult to plan/schedule.
Travelling salesman.
e.g. 16 customer visits = 16! possible ways of visiting the customers.
Thus finding a high quality (or optimum) solution quickly becomes a key concern.
Describe a tool that is used to produce a high quality solution to a difficult routing and scheduling problem.
Greedy Construction Heuristic (GCH).
This involves finding a solution by adding an element (e.g. customer visit) to the solution step by step using a ‘greedy’ criterion in a manner that minimises costs and/or maximises profit.
Give a step by step Greedy Construction Heuristic guide for a Vehicle Routing Problem (VRP).
- Start from the origin e.g. depot
- Calculate the distance from the origin to all desired geographical points to be visited e.d. customer stops
- Select the ‘Nearest Neighbour’ and add this selected point to the partially constructed route.
- Select the last selected point and calculate the distance to the remaining points.
- Select the ‘Nearest Neighbour’ and add it to the partially constructed route.
- Repeat the process until all points have been reached.
List the three factors to consider when using the Greedy Constructed Heuristic method.
- Sequence of visits/stops
- Timing of each visit: Exact time that the service will be delivered
- Total fuel consumption/Travel costs derived from the travelled distance
Give three examples of scenarios that might occur while considering the output of a Greedy Construction Heuristic application.
- Work shift may not be sufficient to cover all stops (Multiple Travelling Salesman problem)
- Certain items must be picked-up/delivered but the vehicles with limited capacity are used (Vehicle Routing Problem)
- Specific customers must be visited at a specific date and time by specialised staff (Vehicle Routing Problem with Time Windows)
In the class example, what are two major steps to consider when trying to solve a Vehicle Routing Problem listed in the previous card?
- Assign the item with the highest capacity to the vehicle with the highest capacity.
- Select the ‘Nearest Neighbour’ using the result from the previous step and see if the assigned clusters to each vehicle remains the same.
List down the rules of sequencing.
- Physical constraints (e.g. activities that use paint)
- Customer priority (e.g. priority banking service)
- Due date
- Last In First Out
- First In First Out
- Longest Operation Time
- Shortest Operation Time First
- Judging sequencing rules (Judging based on performance objectives: dependability, speed, cost, quality, and flexibility)
List down the types of scheduling.
- The complexity of scheduling
- Forward and backward scheduling
- Gantt charts
- Scheduling work patterns e.g. staff rostering
List down the types of controlling.
- Push and pull control
2. Drum, buffer, rope. (Comes from the Theory of Constraints and Optimised Production Technology)
List the two types of demand.
- Dependent demand
2. Independent demand
What is the P:D ratio?
This is the time it takes the customer to wait for the product/service compared to the total time it takes to carry out all the activities required to avail the product/service to the customer.