Methods for schedule optimization sorting of dry end orders on a corrugator to minimize short order recovery time

    公开(公告)号:US09933777B2

    公开(公告)日:2018-04-03

    申请号:US14747373

    申请日:2015-06-23

    Applicant: Marquip, LLC

    CPC classification number: G05B19/41865 Y02P90/20 Y02P90/205 Y02P90/24

    Abstract: A method and a non-transient computer readable medium for sorting orders to be run on a multi-section slitter/scorer at a corrugator dry end includes collecting specifications of orders in current, prior, and/or subsequent paper group queues. Run times and slit/score head recovery times for orders in the current paper group queue are calculated using the specifications. Those orders for which recovery time exceeds run time are flagged as short orders. For a given short order, pairs of preceding and following orders that would require recovery times less than the short order's run time are determined and flagged as potential bracketing pairs. The current paper group queue is searched to determine if a bracketing pair can be formed from its orders, and if so, the orders in the current paper group queue are reorganized such that the orders in the bracketing pair immediately precede and follow the given short order.

    Methods for Schedule Optimization Sorting of Dry End Orders on a Corrugator to Minimize Short Order Recovery Time
    2.
    发明申请
    Methods for Schedule Optimization Sorting of Dry End Orders on a Corrugator to Minimize Short Order Recovery Time 有权
    计划优化方法对波纹机上的干式订单进行排序,以最大限度地缩短订单恢复时间

    公开(公告)号:US20160004249A1

    公开(公告)日:2016-01-07

    申请号:US14747373

    申请日:2015-06-23

    Applicant: Marquip, LLC

    CPC classification number: G05B19/41865 Y02P90/20 Y02P90/205 Y02P90/24

    Abstract: A method and a non-transient computer readable medium for sorting orders to be run on a multi-section slitter/scorer at a corrugator dry end includes collecting specifications of orders in current, prior, and/or subsequent paper group queues. Run times and slit/score head recovery times for orders in the current paper group queue are calculated using the specifications. Those orders for which recovery time exceeds run time are flagged as short orders. For a given short order, pairs of preceding and following orders that would require recovery times less than the short order's run time are determined and flagged as potential bracketing pairs. The current paper group queue is searched to determine if a bracketing pair can be formed from its orders, and if so, the orders in the current paper group queue are reorganized such that the orders in the bracketing pair immediately precede and follow the given short order.

    Abstract translation: 用于分类在波纹机干燥端的多段分切机/打点机上运行的订单的方法和非瞬时计算机可读介质包括收集当前,先前和/或后续纸组队列中的订单的规格。 使用规格计算当前纸张组队列中的订单的运行时间和狭缝/分数头恢复时间。 那些恢复时间超过运行时间的订单被标记为短订单。 对于给定的短期订单,确定需要比短期运行时间少的恢复时间的先前和后续订单对,并将其标记为潜在的包围对。 搜索当前纸组队列以确定是否可以从其订单形成包围对,如果是,则重新组织当前纸组队列中的订单,使得包围对中的订单紧随着给定的短订单 。

Patent Agency Ranking