What Is Setup Time in Manufacturing?

Setup time is the time it takes to prepare a machine for a specific job before productive work can begin: installing tooling, cleaning, calibrating, and loading a first article. It is separate from run time, the time to actually produce the parts. A scheduler reserves setup time in front of a step's run hours, so the plan accounts for the whole block a machine is occupied. Because setup is a fixed cost paid per job rather than per part, it strongly rewards grouping similar work together.

This entry defines setup time and shows how it behaves inside EDGEBIC by User Solutions. For the wider index of planning terms, see the manufacturing glossary, and for the grouping method that tames it, read what is a setup family and sequence-dependent changeover.

How it works

The everyday version is a barber's two-minute comb-and-clippers reset between customers. It happens once per customer regardless of how long the haircut takes, and it is pure overhead: no hair is cut during it. Machine setup is the same idea at larger scale, covering fixture changes, tool loading, cleaning, and a first-article check before real production starts.

In a schedule, setup sits in front of run time. Run time scales with quantity, half an hour per part times a hundred parts, while setup is a flat block paid once for the job. That asymmetry is why batch size matters: a big batch spreads the fixed setup over more parts, and running the same product back to back avoids paying setup again at all.

The subtler case is sequence-dependent setup, where the changeover depends on what the machine just ran. A paint booth going from white to black might need an hour, while black to white needs four hours of solvent flushing. A single setup number cannot express that. It takes a from-product to-product matrix, and once you have one, the order jobs run in becomes a lever: grouping like colors or moving light to dark can cut total changeover dramatically compared with an arbitrary sequence.

A concrete example

A booth has six jobs queued for the day in four colors. Treated with a flat thirty-minute setup each, the schedule looks tidy and predicts everything finishes by shift end. But the real changeovers, driven by the color transitions, add up to far more than the flat number assumed, so the day silently runs over.

Model the changeovers honestly and two things happen. First, the schedule tells the truth: white to black costs an hour, black to white costs four, and the day genuinely needs more than one shift in the queued order. Second, resequencing helps. Group the whites together, run the single red, then the blacks, and same-color runs cost zero setup while only a couple of transitions cost real time. The identical six jobs now fit the shift with room to spare, because the plan paid setup for transitions that actually occur instead of a flat charge per job.

How EDGEBIC uses it

EDGEBIC treats setup time as a resolvable value with several tiers, from a simple flat number up to a full sequence-dependent matrix. At the base, each routing step carries a flat setup time in hours that the engine books in front of the step's run hours, and a work center can supply a default setup as a fallback. That alone lets the plan reserve the real occupied block on the machine.

For plants where changeover depends on the transition, EDGEBIC resolves setup from a matrix. It records the product the work center last ran, then looks up the changeover from that product to the incoming one, first at the product level and then at a coarser setup-family level, before falling back to the step or work center default. A same-product run resolves to zero setup, and the first job on a work center with no predecessor resolves as a cold start. Every scheduled step records which tier its setup came from, so a planner can see on the Gantt tooltip whether a value came from the matrix or a default.

This makes setup an honest, sequence-aware cost rather than a flat guess, which in turn makes grouping and sequencing decisions meaningful. To understand the family grouping that keeps the matrix compact, continue with what is a setup family and sequence-dependent changeover. For the buffer time that sits between steps, read what is queue time in manufacturing scheduling. And for the engine that books setup and run time into finite capacity, see what is advanced planning and scheduling.