EpicorĀ® Finite Job Scheduling | Tomerlin-ERP

Tomerlin-ERP is the recognized leader in Finite Job Scheduling

Epicor Finite Job Scheduling

Why Use Finite Job Scheduling

Do your customers demand on time delivery? There is only one utility in any ERP software which will enable you to meet this critical customer requirement. That utility is finite job scheduling. In fact, Epicor ERP finite job scheduling has only two objectives; 1) first it attempts to have every job completed on time so delivery dates can be met, and 2) if any jobs cannot be finished on time, it attempts to minimize their lateness to the extent possible. If you have hundreds of open, active jobs on your shop floor, your must use finite job scheduling.

Tomerlin-ERP is considered by it customers as the expert at Epicor Finite Job Scheduling. Tomerlin-ERP scheduling consultants know that once finite job scheduling is implemented and deployed, it is critical to have to information the finite scheduling module collects each night be both timely and accurate.

Don Agostino, Tomerlin-ERP’s Training Manager, developed the materials for both Epicor’s engineering and scheduling classes. Contact us now and one of our scheduling consultants will assist you with the implementation of finite job scheduling for your shop floor.

 

We have helped hundreds of our customers launch Epicor ERP software. Let us help you!

Click on "Contact Us" below and send an inquiry. We will get back to you ASAP!

Advanced Planning and Scheduling (APS)

Some functions of Advanced Planning and Scheduling:

  • Automated Scheduling by Capability – Define a capability or skill level and tie it to multiple resources rather than define a resource group or individual resource in the planning process. The APS determines, based on the available resources, which individual resource to schedule for the operation.
  • Dependent Capabilities – Link dependent capabilities with the primary capability when operations require dependent skills to perform the operation.
  • Finite or Infinite Capacity –Define each resource’s capacity as either finite or infinite . When a piece of the schedule is moved, the resource is rescheduled according to its specific type.
  • Material Constraints – Use an existing method of manufacture to consider material availability as a scheduling constraint. Integrated directly with Inventory and Purchasing, APS knows when material is due and schedules accordingly.

Key Components of Epicor Finite Job Scheduling

The scheduling engine handles the supply and demand of time through three main components – Capacity, Load, and Scheduling Blocks. The purpose of each component is discussed here, but these items are explored in more detail later within the Primary Components information.

  • Capacity – This component of Epicor Finite Job Scheduling measures how much time or production output (non-time capacity) is available for the resources within your manufacturing center; capacity represents the supply available in the schedule. Each resource has a capacity limit that is available during each working day. Depending on how you want the scheduling engine to handle capacity, resources can or cannot be assigned more demand than can be satisfied through their capacity. A resource can have either finite or infinite capacity.
  • Load – This componentĀ of Epicor Finite Job Scheduling measures how much time or production output is required by operations to complete part quantities. Load represents the demand that is placed against the schedule. It is the amount of time or production output that the resource needs in order to complete the operation. The load required for each job is calculated by the part quantity needed, the operations required to complete production, and the availability of resources to complete the job’s part quantity.
  • Scheduling Blocks – The scheduling engine uses this component of Epicor Finite Job Scheduling to calculate the amount of load that is required to complete an operation. A scheduling block is a record that measures the length of time during which work will be done on one operation. First, the scheduling engine determines how much time it will take to complete the operation. Then the engine calculates how many scheduling blocks are required to handle the load. The length of these time allocation records will vary, depending upon the quantity produced, the number of resources (machines or operators) available, whether the operation can be divided, and so on. When the scheduling engine calculates how many scheduling blocks will handle the load, it checks how much capacity in time is available on the resources that will complete the operations. At this point, each scheduling block resembles a puzzle piece, as the engine tries to fit each block into a segment of open time on a resource. When all of the scheduling blocks are placed into the resource’s time, the job is scheduled.