Detailed Scheduling
Detailed scheduling is the fine-grained, short-term production planning that fixes the exact timing of individual operations and assigns them under the constraint of the limited (finite) capacity of a specific machine, resource, or team. It determines the sequence in which production orders are processed at each work center and thereby sets the concrete start and finish time of every operation.
Detailed scheduling is the final, most granular stage of production planning: for every single operation of a production order, it defines at which work center and at exactly what time it will be processed. Unlike the upstream rough-cut planning, detailed scheduling works with finite capacity – it accounts for the fact that a machine or an employee can process only one order at a time – and derives a concrete, overlap-free sequence from that. The result is a realistic, minute-accurate occupancy plan, often visualized as a planning board or Gantt chart.
In doing so, detailed scheduling answers the operational question "when does which work center do what?" for the short horizon of days to a few weeks. It translates the quantitative requirements planning (which orders in which lot size should be produced by when) into an executable time sequence and is thus the link between planning and shop-floor control. Without detailed scheduling, due dates remain rough weekly commitments; with it, a reliable schedule emerges that accounts for setup times, bottlenecks, and priorities.
At a glance
- Fine-grained, short-term scheduling of individual operations (horizon: days to weeks)
- Works with finite capacity – each work center can process only one operation at a time
- Result: an overlap-free sequence and occupancy plan (planning board / Gantt)
- Optimized toward goals such as on-time delivery, short lead time, or minimal setup times
- Link between requirements planning (MRP) and shop-floor control (shop-floor data collection / MES)
What sets detailed scheduling apart from rough-cut planning
Production planning runs in several stages with a shrinking horizon and increasing precision. Program and requirements planning (classically via MRP) first determines which end products are needed in which quantities by when, and proposes production orders for them. The subsequent rough-cut planning checks at a weekly or daily level whether the available capacity groups can in principle carry the load – usually still with an infinite-capacity assumption or at an aggregated level.
Detailed scheduling picks up from there and gets concrete: it breaks the orders down into their individual operations, assigns each operation to a specific work center, and fixes its exact position on the timeline. Here the constraint of finite capacity applies: a work center can process only one order at a time, and the occupancies must not overlap. This condition inevitably produces a sequence – the core task of detailed scheduling.
Finite vs. infinite capacity
The decisive technical difference is the capacity assumption. Infinite scheduling times every operation to the earliest or latest possible point without checking whether the work center is free – overloads are only made visible, not resolved. Detailed scheduling, by contrast, works with finite capacity: it fills work centers without gaps, automatically pushes competing operations back, and thereby delivers a realistically feasible plan rather than a mere wish-list schedule.
How detailed scheduling works
The data basis for detailed scheduling is the production orders with their routings. For each operation, the routing supplies the required resource as well as the standard times – above all setup time and unit time – from which the occupancy duration per operation is derived. Added to this are the capacity master data of the work centers (shift calendar, available hours, parallel machines) and the current order priorities and due dates.
On this basis, the system schedules the operations. In forward scheduling, planning runs ahead from the earliest start date; in backward scheduling, it runs backward from the due date. When several operations compete for the same work center, a sequencing rule (priority rule) decides which runs first – for example by earliest due date, shortest processing time, or minimal changeover between similar orders. The goal is an optimum among often competing metrics: high on-time delivery, short lead time, good capacity utilization, and low setup costs.
Bottleneck focus and setup optimization
In practice, detailed scheduling often orients itself around the bottleneck: the most heavily loaded work center determines the throughput of the entire production, which is why its occupancy is optimized first and the rest of the flow aligned to it (bottleneck control). A second typical lever is setup optimization: if orders with similar setup states – say the same color, the same tooling – are deliberately loaded back to back, the sum of setup times drops noticeably, though often at the expense of the on-time delivery of individual orders. Detailed scheduling must weigh these goals against one another.
Why detailed scheduling matters
Without reliable detailed scheduling, due dates remain estimates. Only the capacity-accurate sequence reveals whether a promised date is realistic, and it makes bottlenecks visible before they cause delay. This improves on-time delivery externally and internally creates a dependable basis for the available-to-promise check: sales can commit firmly because the shop-floor occupancy can actually be mapped.
At the same time, good detailed scheduling unlocks economic reserves. Shorter lead times reduce the capital tied up in work in progress, a smoothed occupancy cuts idle time and overtime, and a setup-optimized sequence saves unproductive changeover time. Because detailed scheduling responds to the current order situation, it is also the tool with which the operation answers disruptions: machine breakdown, rush orders, or missing material can be absorbed through rescheduling without discarding the entire production plan.
Detailed scheduling in the ERP and MES system
In ERP systems with a production module, detailed scheduling is part of production planning and control (PPC). It draws on the results of material requirements planning (MRP/MRP II) and uses the master data from routing and work center. Simple ERP solutions offer a graphical planning board with manual rescheduling via drag and drop; more capable systems or specialized APS tools (Advanced Planning and Scheduling) automate sequence building with optimization algorithms and constraints such as tooling availability or shift models.
A closed control loop only emerges through the interplay with the shop floor: shop-floor data collection and a Manufacturing Execution System (MES) report completions, disruptions, and actual times back in real time. If these deviate from the plan, the system reschedules – ideally event-driven. This turns detailed scheduling from a one-off advance schedule into an ongoing, rolling control that adapts the plan to the real production situation.
Distinguishing detailed scheduling, capacity planning, and time scheduling
The terms overlap but mean different things. Capacity planning asks, in aggregate, whether enough capacity is available, and belongs mostly to rough-cut planning. Time scheduling is the computational determination of start and finish points (forward/backward) and is thus a method within detailed scheduling. Detailed scheduling itself is the comprehensive, capacity-constrained flow and sequence planning that combines timing, resource assignment, and sequencing into an executable plan.
Example
Example: metal processor with a CNC bottleneck
A mid-sized supplier produces turned parts in series. For the coming week there are twelve production orders, all of which run over the same CNC lathe – the recognizable bottleneck of the operation. Quantities and target dates come from the MRP requirements planning; detailed scheduling takes over the operations from there, with their setup and unit times from the routing.
On the planning board in the ERP, the production manager schedules the orders backward from the due dates and lets the system compute the CNC occupancy with finite capacity. It turns out that two orders collide. Because four orders use the same fixture, he deliberately arranges them back to back – saving three changeovers. A rush order is dragged forward via drag and drop; the downstream operations shift automatically. When shop-floor data collection later reports a machine stoppage, the system reschedules the rest of the week and immediately flags the delayed orders, so that sales can inform the affected customers in good time.
Frequently asked questions
Matching ERP systems
Related services
Sources
Questions about Detailed Scheduling in your ERP project?
We advise vendor-neutrally – and implement it ourselves on request.