Scheduling, Sequencing and Resource Coordination

Introduction

Route planning determines where vehicles should travel; scheduling determines when activities occur; sequencing determines the order in which jobs are performed; and resource coordination ensures that vehicles, drivers, docks, equipment, and facilities are available at the required times. These decisions are interdependent. A route that is geographically efficient may be operationally infeasible if it arrives before a customer is open, exceeds a driver’s legal duty limit, encounters a full dock, or requires a vehicle that is undergoing maintenance.

In contemporary supply chains, scheduling is therefore a coordination problem rather than merely a timetable-construction exercise. The planner must reconcile customer appointments, travel-time uncertainty, loading and unloading durations, fleet capacity, crew availability, driver breaks, shift boundaries, maintenance windows, and service-level commitments. The central managerial challenge is to create plans that are efficient under normal conditions but sufficiently robust under disruption.

This chapter develops an integrated framework for scheduling and sequencing delivery operations. It combines operations-management theory, vehicle-routing logic, workforce constraints, dock coordination, and practical control processes.

Learning Objectives

By the end of this chapter, the reader should be able to:

1. Distinguish routing, scheduling, sequencing, and resource-coordination decisions.
2. Model delivery appointments, time windows, service times, breaks, shifts, and maintenance constraints.
3. Construct feasible loading and delivery sequences.
4. Explain the interaction between docks, fleets, crews, and driver-hours regulations.
5. Evaluate schedules using cost, utilization, punctuality, safety, and resilience measures.
6. Apply a structured method to an integrated scheduling problem.
7. Critically assess technology, uncertainty, governance, and ethical issues in scheduling.

1. The Integrated Scheduling Problem

A delivery plan has at least five linked layers:

A feasible schedule must satisfy all relevant constraints simultaneously. Let a route visit stops in the order 1, 2, ..., n. For stop i, let:

• aᵢ = arrival time,
• sᵢ = service-start time,
• cᵢ = service-completion time,
• pᵢ = service duration,
• τᵢⱼ = travel time from stop i to stop j,
• [eᵢ, lᵢ] = permitted service window.

The earliest possible service start at stop i is constrained by arrival and opening time:

Completion is:

For consecutive stops i and j:

These equations assume deterministic travel and service times and no unmodeled interruptions. If the route arrives before eᵢ, the vehicle waits. If it arrives after lᵢ, the schedule violates the appointment unless lateness is permitted.

A useful measure of waiting at stop i is:

where wᵢ is measured in minutes or hours. Lateness, when the appointment deadline is lᵢ, can be represented as:

The distinction between waiting and lateness is operationally important. Waiting consumes driver and vehicle time but may preserve service quality; lateness may trigger penalties, lost sales, or customer dissatisfaction.

2. Scheduling, Sequencing and Coordination Concepts

2.1 Scheduling versus sequencing

Scheduling assigns activities to time periods and resources. Sequencing determines their order. For example, a dispatcher may schedule four deliveries between 08:00 and 16:00, while sequencing determines whether the truck visits A–B–C–D or A–C–B–D. A different sequence changes travel time, arrival times, loading stability, and the feasibility of customer appointments.

2.2 Time windows and appointments

A hard time window requires service to begin or occur within a specified interval. A soft time window allows violation at a cost. A general objective may minimize operating cost plus service penalties:

Here Cₒ is operating cost, αᵢ is the penalty per unit of lateness, βᵢ is the cost assigned to waiting, and all terms must use consistent monetary units. In a hard-window model, lateness is prohibited rather than penalized.

Appointments also create synchronization requirements. A delivery may be feasible only if both the vehicle and the receiving dock are available. Thus, the appointment is not merely a customer constraint; it is a shared-resource reservation.

2.3 Service time

Service time includes activities such as parking, checking in, unloading, inspection, paperwork, pallet exchange, and departure. Treating service time as zero is a frequent planning error. For a multi-stop route, small service-time errors accumulate and can make the final appointments infeasible.

Service time may depend on shipment characteristics:

• number of pallets or cases;
• temperature-control procedures;
• hazardous-material checks;
• lift-gate or tail-lift use;
• customer receiving processes;
• congestion at the facility.

2.4 Resource coordination

A schedule coordinates several finite-capacity resources:

• vehicles, with capacity, compatibility, and operating range;
• drivers, with qualifications, availability, breaks, and hours-of-service limits;
• docks, with appointment capacity and handling equipment;
• loading crews, with shift and productivity constraints;
• maintenance bays and technicians;
• staging areas, which may become bottlenecks even when docks are available.

The bottleneck principle is central: increasing vehicle capacity does not improve throughput if the dock or loading crew remains saturated.

3. Core Models and Constraints

3.1 Vehicle capacity and loading feasibility

For a vehicle with capacity Q and shipment quantities qᵢ assigned to its route, a basic capacity condition is:

This assumes a single additive capacity measure. In practice, weight, volume, pallet positions, axle limits, compatibility, and cube utilization may all be binding. A shipment can fit by weight but fail by volume or axle distribution.

3.2 Driver hours, breaks and shifts

A driver’s duty schedule generally includes driving, service, waiting, loading, breaks, and other required activities. A simplified duty balance is:

where H_d is total duty time. The legal interpretation of each activity depends on the applicable jurisdiction and regulation; organizations must not substitute a simplified planning equation for legal advice.

Breaks should be scheduled as activities with duration and permitted placement, not inserted informally after the route is constructed. A break may be taken during a waiting period only if operational and legal conditions permit it. The schedule should also distinguish driving time from on-duty time and should account for daily and weekly limits where applicable.

Shift constraints can be represented by:

and

for every activity assigned to a worker, unless overtime is explicitly authorized and modeled.

3.3 Dock scheduling

A dock is a renewable but capacity-limited resource. If a dock can serve one vehicle at a time, overlapping service intervals are infeasible. For appointment k, let bₖ and fₖ denote dock-start and dock-finish times. Then, for two appointments k and m assigned to the same single-capacity dock, either:

or

must hold. This is a disjunctive constraint: one appointment must precede the other.

Dock schedules should include buffer time for check-in, door assignment, paperwork, and variability. A nominal schedule that fills every minute may have high theoretical utilization but poor practical reliability.

3.4 Maintenance constraints

Maintenance is a scheduled resource requirement, not an exception to planning. A vehicle unavailable during [m_start, m_end] cannot be assigned to a route overlapping that interval. Preventive maintenance may be coordinated with low-demand periods, but safety-critical work must take priority over utilization targets.

3.5 Precedence constraints

Some activities must occur in a specific order:

• loading precedes departure;
• delivery precedes collection of returned goods;
• unloading precedes pallet exchange;
• a required break may precede continuation of driving;
• inspection precedes release of regulated goods.

If activity A must precede B, then:

Precedence constraints are especially important in mixed pickup-and-delivery routes, where cargo collected at one location may not be placed above freight still required at another stop.

4. Sequencing Principles

4.1 Geographic efficiency is not sufficient

The shortest-distance sequence may violate time windows or create excessive waiting. Sequence selection should consider travel time, service duration, appointment urgency, dock congestion, vehicle capacity, and unloading order.

4.2 Common sequencing rules

Several rules are useful as heuristics:

For job i, a simple critical ratio is:

A lower ratio indicates greater urgency. This heuristic is not universally optimal; it is a prioritization aid and must be tested against route and resource constraints.

4.3 Loading sequence

Loading should reflect the planned delivery sequence, but the two are not always identical. Freight for the first delivery is generally loaded for accessibility, while later freight is placed deeper in the vehicle. The planner must also respect weight distribution, stability, segregation requirements, and reverse logistics.

A loading plan should specify:

1. shipment identity and stop;
2. position or pallet zone;
3. loading order;
4. handling equipment;
5. security or temperature requirements;
6. verification and scan points.

Poor loading sequence causes rehandling, longer service times, product damage, and missed appointments.

5. A Practical Integrated Planning Procedure

A robust planning process can be organized into eight stages.

Stage 1: Validate demand and commitments

Confirm quantities, customer windows, delivery priorities, special handling, access restrictions, and appointment rules. Invalid master data cannot be corrected by an advanced algorithm.

Stage 2: Establish resource calendars

Create calendars for vehicles, drivers, docks, loading crews, maintenance, and facilities. Include breaks, shifts, absences, training, and planned downtime.

Stage 3: Build feasible route candidates

Assign stops to compatible vehicles while respecting capacity, geography, driver qualifications, and facility restrictions. At this stage, planners should use realistic travel-time distributions rather than only average travel times.

Stage 4: Sequence stops and activities

Test alternative sequences using appointment feasibility, travel time, service duration, unloading order, and return requirements. A sequence is acceptable only if all hard constraints are satisfied.

Stage 5: Insert breaks and buffers

Place legally required breaks and operational buffers explicitly. Buffers should be risk-based: congested urban routes and highly variable facilities require more protection than stable, repetitive lanes.

Stage 6: Coordinate docks and crews

Compare vehicle arrival times with dock and crew capacity. Resolve conflicts by shifting appointments, changing doors, resequencing routes, or reallocating labor.

Stage 7: Validate and publish

Run checks for capacity, hours, appointments, maintenance, hazardous-material compatibility, loading order, and shift compliance. Publish one controlled version of the plan to all affected parties.

Stage 8: Monitor and replan

During execution, compare actual progress with the plan. Replanning should prioritize safety, legal compliance, critical customers, and resource feasibility rather than simply minimizing distance.

6. Worked Example: A Small Delivery Route

Consider one truck departing a depot at 08:00. It must serve three customers in the sequence A–B–C. Travel and service data are:

Customer windows are A: 08:30–09:30, B: 09:15–10:30, and C: 10:00–11:30.

The truck arrives at A at 08:30, begins service immediately, and departs at 08:50. It arrives at B at 09:15, services until 09:45, and arrives at C at 10:05. Service at C finishes at 10:20, and the truck returns at 10:55.

The route satisfies all windows. Total route elapsed time is 175 minutes, from 08:00 to 10:55. Productive service time is 65 minutes. If utilization is defined as service time divided by elapsed route time, then:

This measure should not be interpreted as a complete productivity assessment because travel, legally required breaks, waiting, and safety activities may all be necessary. If a 15-minute break is required after B, it could be taken after service at B if legally permitted and operationally appropriate. The arrival at C would then be 10:20 rather than 10:05, still within its window, and return would be 11:10.

The example illustrates why feasibility must be evaluated through time propagation rather than by distance alone.

7. Illustrative Case: NorthRiver Grocery Distribution

Background

NorthRiver Grocery Distribution operates a regional depot serving supermarkets and convenience stores. It has 18 trucks, two outbound loading waves, four receiving docks at the depot, and customer appointments concentrated between 07:00 and 12:00. Vehicles require preventive maintenance every 30 operating days. The company has experienced late deliveries despite high vehicle utilization.

Problem

A review found three causes. First, planners sequenced routes by geographic proximity without modeling unloading duration. Second, the loading team loaded freight according to pallet availability rather than delivery sequence. Third, the dock appointment system allowed several vehicles to be planned for the same narrow receiving interval. Drivers also reported that breaks were frequently treated as an afterthought.

Analysis

NorthRiver mapped the process from order release through vehicle return. It measured actual travel, loading, waiting, and service-time distributions. The analysis showed that a route with 90 minutes of driving could require more than four hours of elapsed time once service, congestion, and waiting were included. The depot’s outbound staging area, not the fleet, was the primary morning bottleneck.

Approach and solution

The company introduced an integrated planning routine:

1. customer windows were classified as hard or soft;
2. routes were built with time-dependent travel estimates;
3. loading lists were generated from the delivery sequence;
4. dock appointments were capacity-checked;
5. driver breaks and shift limits were inserted before publication;
6. maintenance availability was included in the vehicle calendar;
7. a 10–15 percent buffer was applied selectively to high-variability activities;
8. dispatchers received exception alerts when predicted lateness exceeded a threshold.

The company also created a daily coordination meeting involving transport, warehouse, customer service, and maintenance representatives. This reduced local optimization, in which one department improved its own metric while worsening total flow.

Outcome

In this illustrative case, on-time delivery improved from 88% to 95% over three months, while average route distance changed little. The main gains came from reducing dock conflicts, improving loading order, and protecting critical appointments. Vehicle utilization declined slightly, but completed deliveries per shift increased because fewer vehicles were trapped in avoidable waiting and rehandling.

Learning points

The case demonstrates four principles. First, service reliability depends on the entire process, not only driving. Second, loading and dock schedules are integral to route feasibility. Third, selective buffers can improve throughput when variability is significant. Fourth, performance metrics must balance utilization with punctuality, safety, employee welfare, and total completed work.

8. Performance Measurement and Control

A scheduling system should use a balanced set of measures:

• on-time arrival and on-time completion;
• appointment-window compliance;
• route-plan adherence;
• vehicle and driver utilization;
• dock utilization and queue time;
• loading and unloading duration;
• empty kilometres;
• overtime and break compliance;
• maintenance-related disruption;
• cost per delivery or stop;
• failed delivery and reattempt rate;
• safety incidents and near misses.

On-time performance should define the event and tolerance clearly. For example, arriving within a 15-minute tolerance is different from beginning service within the customer’s formal window. Metrics should also separate controllable from uncontrollable causes. Penalizing drivers for facility-caused waiting can produce unsafe or deceptive behavior.

A useful control process compares planned and actual values. Let deviation for activity i be:

The unit of ∆ᵢ must be explicit, such as minutes. Repeated positive deviations at the same facility indicate biased planning data or a process problem rather than random noise.

9. Uncertainty, Robustness and Rescheduling

Travel times, service durations, demand, weather, and equipment availability are uncertain. A deterministic schedule may be feasible on paper but fragile in execution. Robust scheduling uses buffers, alternative resources, flexible appointments, and predefined response rules.

A practical approach is scenario testing. Evaluate the plan under normal, congested, delayed-loading, vehicle-breakdown, and high-demand scenarios. The objective is not necessarily to optimize the average scenario; it is to avoid unacceptable performance in plausible adverse scenarios.

Dynamic rescheduling should follow a hierarchy:

1. protect safety and legal compliance;
2. preserve critical customer commitments;
3. prevent resource deadlock;
4. minimize additional cost and distance;
5. communicate changes promptly.

Frequent changes can themselves create instability. A plan should therefore include a freeze horizon: activities within a short period are changed only for material exceptions, while later activities remain flexible.

10. Technology and AI in Scheduling

Transportation-management systems integrate orders, maps, telematics, appointment calendars, driver status, and vehicle availability. Optimization engines may use mixed-integer programming, constraint programming, metaheuristics, or simulation. No method is universally superior: exact optimization can be powerful for smaller structured problems, while heuristics and hybrid methods are often practical for large, changing operations.

Machine-learning models can estimate travel time, service duration, no-show probability, or late-arrival risk. Their value depends on data quality and governance. Predictions should be monitored for drift, explainability, and unequal effects on drivers, customers, or facilities. AI should support professional judgment rather than conceal accountability behind an opaque recommendation.

Human planners remain essential for unusual access conditions, relationship-sensitive customers, emergencies, labor considerations, and ethical trade-offs. A technically optimal schedule that violates a collective agreement or pressures drivers to compromise safety is not an acceptable solution.

11. Governance, Safety and Ethical Considerations

Scheduling decisions affect worker fatigue, road safety, customer access, and environmental impact. Organizations should comply with applicable hours-of-service, working-time, health-and-safety, dangerous-goods, accessibility, and data-protection requirements.

Important governance practices include:

• maintain an auditable record of schedule changes;
• separate legal constraints from negotiable preferences;
• protect driver and customer data;
• prohibit incentives that encourage speeding or skipped breaks;
• provide escalation routes for unsafe plans;
• review algorithmic recommendations for systematic bias;
• include maintenance and safety work in performance expectations;
• communicate realistic appointments rather than selling infeasible promises.

Sustainability should also be assessed beyond kilometres. A schedule may reduce distance but increase idling, failed deliveries, refrigeration energy, or overtime. Total environmental and social effects should be considered alongside financial cost.

12. Best-Practice Checklist

Before releasing a schedule, the planner should ask:

1. Are all appointments and facility opening times valid?
2. Are travel, service, loading, and unloading durations realistic?
3. Does each vehicle satisfy weight, volume, compatibility, and maintenance constraints?
4. Are driver qualifications, shifts, breaks, and hours compliant?
5. Are dock and crew capacities non-overlapping and feasible?
6. Does the loading sequence support the delivery sequence and safe weight distribution?
7. Are buffers proportional to uncertainty?
8. Are escalation and rescheduling rules defined?
9. Can the schedule be explained to drivers, customers, and supervisors?
10. Are safety, privacy, labor, and environmental impacts addressed?

Chapter Summary

Scheduling, sequencing, and resource coordination transform a proposed route into an executable operating plan. Feasibility depends on more than distance: appointments, time windows, service durations, vehicle capacity, loading order, docks, crews, driver hours, breaks, shifts, maintenance, and precedence relationships must be coordinated. Time propagation provides a basic test of arrival, service, waiting, and completion times, while disjunctive resource constraints prevent overlapping use of limited docks or equipment.

Effective practice combines route construction with realistic calendars, explicit breaks, selective buffers, loading discipline, dock coordination, and continuous monitoring. Performance should balance punctuality, cost, utilization, safety, employee welfare, maintenance, and resilience. Technology and AI can improve prediction and optimization, but data quality, human oversight, legal compliance, and ethical governance remain essential. The best schedule is not the one that appears most efficient under perfect conditions; it is the one that reliably delivers required service while protecting people, assets, and long-term system performance.

Key Terms

Scheduling: Assigning activities to times and resources.

Sequencing: Determining the order in which activities or stops occur.

Time window: Permitted interval for service or arrival.

Hard constraint: Requirement that cannot be violated in a feasible plan.

Soft constraint: Requirement whose violation is allowed with a penalty.

Service time: Time required to perform customer or facility activities.

Waiting time: Time a resource is idle before an activity can begin.

Precedence constraint: Requirement that one activity precede another.

Dock scheduling: Allocation of receiving or shipping capacity across appointments.

Resource calendar: Availability record for vehicles, workers, docks, or equipment.

Driver hours of service: Legal or organizational limits on driving and duty time.

Loading sequence: Order and physical arrangement in which freight is loaded.

Buffer: Planned time protecting a schedule against variability.

Freeze horizon: Period during which plan changes are restricted.

Critical ratio: Priority measure based on remaining time and processing requirements.

Robust schedule: Plan designed to remain feasible under plausible uncertainty.

Route adherence: Degree to which execution follows the planned route and timing.

Bottleneck: Resource or process stage that limits system throughput.

Time propagation: Calculating successive arrival, service, and completion times.

Disjunctive constraint: Constraint requiring one of two activities to occur before the other.

Review Questions

Short Answer Questions

1. How does sequencing differ from scheduling?
2. Why must service time be included in route planning?
3. What is the purpose of a resource calendar?
4. Explain the difference between a hard and a soft time window.
5. Why should driver breaks be modeled as scheduled activities?

Long Answer Questions

1. Explain how customer appointments, docks, vehicles, and crews interact in an integrated schedule.
2. Compare at least three sequencing rules and discuss when each may be appropriate.
3. Describe a complete procedure for developing and publishing a delivery schedule.
4. Discuss why loading sequence can affect both service performance and safety.
5. Evaluate the benefits and limitations of AI-enabled scheduling in transportation operations.

Analytical / Application Questions

1. A route arrives 10 minutes before a customer opens, requires 25 minutes of service, and then travels 40 minutes to a second customer. Explain how waiting affects the second appointment and identify two feasible corrective actions.
2. A depot has one dock and three appointments whose service intervals overlap. Formulate the precedence alternatives required to make the appointments feasible, then discuss the operational information needed to select the best order.
3. Design a rescheduling policy for a route whose vehicle becomes unavailable two hours before departure. Your policy should address safety, maintenance, customer service, driver hours, and communication.

Multiple Choice Questions with Answers

Question 1

Which statement best distinguishes scheduling from sequencing?

A. Scheduling assigns activities to times and resources, while sequencing determines their order.

B. Scheduling determines vehicle capacity, while sequencing determines legal compliance.

C. Scheduling measures service quality, while sequencing measures fuel consumption.

D. Scheduling applies only to warehouses, while sequencing applies only to roads.

Correct Answer: A. Scheduling assigns activities to times and resources, while sequencing determines their order.

Question 2

A vehicle arrives at 08:20 and the customer opens at 08:35. What is the waiting time before service can begin?

A. 5 minutes

B. 10 minutes

C. 15 minutes

D. 20 minutes

Correct Answer: C. 15 minutes

Question 3

Which item is a precedence constraint?

A. The vehicle must be painted before the end of the month.

B. Loading must be completed before departure.

C. The route should use the shortest road.

D. The driver should prefer urban roads.

Correct Answer: B. Loading must be completed before departure.

Question 4

What is the primary purpose of a dock schedule?

A. To determine fuel price

B. To allocate limited receiving or shipping capacity across appointments

C. To replace vehicle maintenance planning

D. To calculate product demand

Correct Answer: B. To allocate limited receiving or shipping capacity across appointments

Question 5

If service time at three stops is 20, 30, and 15 minutes, what is total service time?

A. 45 minutes

B. 55 minutes

C. 60 minutes

D. 65 minutes

Correct Answer: D. 65 minutes

Question 6

Which sequencing rule prioritizes jobs with the least time relative to remaining processing requirements?

A. Nearest-next-stop rule

B. Critical-ratio rule

C. Largest-shipment-first rule

D. Randomized sequencing

Correct Answer: B. Critical-ratio rule

Question 7

Why should maintenance be included in the vehicle calendar?

A. A vehicle undergoing maintenance cannot reliably be assigned to an overlapping route.

B. Maintenance always reduces customer demand.

C. Maintenance eliminates the need for driver breaks.

D. Maintenance determines the delivery sequence automatically.

Correct Answer: A. A vehicle undergoing maintenance cannot reliably be assigned to an overlapping route.

Question 8

Which measure most directly indicates whether customer appointments are being met?

A. Vehicle paint condition

B. On-time appointment compliance

C. Number of loading bays owned

D. Average driver age

Correct Answer: B. On-time appointment compliance

Question 9

What is a principal risk of filling every minute of a schedule with planned work?

A. Excessive unused capacity in all circumstances

B. Inability to absorb travel and service variability

C. Automatic improvement in safety

D. Reduced need for accurate data

Correct Answer: B. Inability to absorb travel and service variability

Question 10

Which is an appropriate priority during dynamic rescheduling?

A. Protect safety and legal compliance first

B. Maximize distance traveled first

C. Remove all planned breaks first

D. Ignore maintenance availability

Correct Answer: A. Protect safety and legal compliance first