作业车间进度计划运行 (tisch1100m000)

地点标识。

The date on which the schedule process started for the specified schedule run.

/baanerp/ti/rou/tirou0101m400#tirou001.plgr

The run ID.

The run ID consists of two parts to distinguish different runs calculated from the same input data.

• A meaningful code based on a mask. (9 positions, including a counter)
• A sequence that is controlled by LN.

If the run is based on new input data the sequence number is 01.

If the run is based on existing input data the sequence number is 02, 03 and so forth.

The iteration of the run.

Minimizing of maximal lateness of the production orders for which the scheduler is run.

The scheduler uses the earliest due date algorithm to generate run output.

如果选中此复选框， the changeover critical machine has all states empty at the start of the run.

If this check box is cleared, the last known state of the changeover critical machine is taken at the start of the run.

The time fence date defined in days.

The date up to which production orders are considered for scheduling.

The time fence date calculated based on the calendar for the specified site.

如果选中此复选框， production order planning is automatically updated with the results once the scheduler is run.

The employee responsible for generating the run.

The total number of production order with the status Created, Printed, Released or Active within the time frame of the scheduler run.

If one or more operations of a production order have a start date within the time frame of the scheduler run the whole order is considered for scheduling. If an order doesn't have operations, the start date of the order is determining.

Production orders with the status Created and an end date before the time fence are considered to fall into the time frame of the scheduler run.

The total number of machine operations of the production orders that are defined as within the time frame. An order operation without machine operations is considered as one machine operation.

The lateness of an order is defined as the time difference between the due date and planned finish date using the site calender. The total days the order is late divided by the number of orders, expressed in whole days.

All operations of a production order are scheduled if one or more (machine) operation of the production order are in the time frame that is scheduled. The scheduler determines the due date for each (machine) operation and schedules accordingly.

Once scheduling is complete, (machine) operations can have a new planned finish dates which will influence the planned finish date of the production order

The total changeover time sums up the changeover times of all machine operations in the schedule which are on a changeover critical machine capacity group.

The sum of the utilizations of the machines divided by the number of machines, expressed as a percentage.

The machine utilization is calculated for the period of the time frame as:

Total number of Setup Hours (created, scheduled, active, completed)

+

Total number of Setup Hours (created, scheduled, active, completed)

/

Total number of available Machine Hours

-

Any applicable Time Out

The number of operations for which the planning could not be resolved.

Conflicts can be caused by:

• Overlapping operations on a machine
• A uncompleted operation within the time frame

The number of conflicts is an indicator how feasible the schedule is.

The date the scheduler run was generated.

生产订单已更新

如果选中此复选框， the selected production orders were updated.

The time fence for the schedule run calculated from the creation date onwards.

LN 计划生产订单的时间段跨度以工作天数表示。

在生产计划中不会包含起始日期晚于跨度日期的生产订单。

可以在排程器设置 (tisch0140m100) 进程中设置计划组的时界。您可以从菜单启动该进程。

The horizon is calculated from the creation date onwards.

The name of the employee who updated the production orders.

The date the scheduling run was finsihed.

The duration of the run in hours, minutes, and seconds.

最小最大延迟

The schedule run has as objective to minimize the maximum lateness with which the production orders are delivered.

最小化总准备时间

The schedule run has as objective to minimize the total setup time for the machine capacity groups needed for the production of the order.

最早到期日 (EDD)

The algorithm calculates the scheduling run based on the earliest possible due date for the completion of the production order.

最早到期日, 最短准备时间 | 最早到期日

The algorithm calculates the scheduling run based on the earliest possible due date rule for not changeover critical machine capacity groups and the shortest setup time rule for the changeover critical machine capacity group. The shortest setup time rules has the earliest due date rules as a tie breaker.

The numbers of orders that are on time or early divided by the total number of orders, expressed as a percentage.