-
公开(公告)号：US06321132B1
公开(公告)日：2001-11-20
申请号：US09129825
申请日：1998-08-05
IPC分类号： G06F1900
CPC分类号： G06Q10/04 , G06Q10/087 , G06Q10/0875
摘要： An efficient computer implemented method is used to design slabs for production from an order book. This method minimizes the number of slabs designed to fulfill an order book. This method is based on a heuristic algorithm which is a variant of the greedy approach for the set covering method. The variations are novel in three ways. First, designing slabs using the flexibility in the order size; second, using weight for choosing large slabs; and third, controlling the exponential nature of enumeration of the set of all subsets by constructing only the largest slab at each step.
摘要翻译： 一种高效的计算机实现方法用于从订单簿中设计用于生产的板坯。 这种方法最大限度地减少了设计用于完成订单的平板数量。 该方法基于启发式算法，该算法是集合覆盖方法的贪心方法的变体。 这些变化在三个方面是新颖的。 首先，使用订单尺寸的灵活性设计板坯; 第二，使用重量选择大板; 第三，通过在每个步骤中仅构造最大的平板来控制所有子集的枚举的指数性质。
-
公开(公告)号：US6044361A
公开(公告)日：2000-03-28
申请号：US47275
申请日：1998-03-24
CPC分类号： G06Q10/04 , G06Q10/087 , G06Q10/0875
摘要： A fast computer implemented method generates near-optimal solutions to the multi-objective inventory matching problem by solving for multiple objectives simultaneously and generating multiple non-dominating solutions. The method implements a multi-assignment backjumping algorithm that consists of three steps. The first step is a rappeling step in which a feasible solution is created by applying Iterative Bipartite Matching and maximum flow algorithm. Near-optimal feasible solutions are stored in a non dominated set. The second step is to use a multi-key sort to identify undesirable matches in a given feasible solution. The third step is backlifting the solution by removing undesirable matches from the feasible solution and places those undesirable matches on a no good set of matches. If the feasible solution is non-dominated, a copy is stored in a non-dominated set. The feasible solution is finally provided as input to the repelling step.
摘要翻译： 快速计算机实现方法通过同时解决多个目标并生成多个非主导解决方案，为多目标库存匹配问题生成近似最优解。 该方法实现了由三个步骤组成的多分配反向算法。 第一步是通过应用迭代双边匹配和最大流算法创建可行解决方案。 近似最优可行解存储在非主导集中。 第二步是使用多键排序来识别给定的可行解决方案中的不合需要的匹配。 第三步是通过从可行解决方案中移除不需要的匹配来解决问题，并将这些不合需要的匹配放在一组不错的匹配上。 如果可行的解决方案是非主导的，则将副本存储在非主导的集合中。 最终提供可行的解决方案作为排斥步骤的输入。
-
3.发明授权Method for creating a direct hot charge rolling production schedule at a steel plant 失效在钢铁厂建立直接热轧生产计划的方法
公开(公告)号：US5808891A
公开(公告)日：1998-09-15
申请号：US688573
申请日：1996-07-30
申请人： Ho Soo Lee , Mark Elliot Trumbo
发明人： Ho Soo Lee , Mark Elliot Trumbo
IPC分类号： G05B19/418 , G05B19/42
CPC分类号： G05B19/41865 , Y02P90/20 , Y10S706/904
摘要： A scheduling method suitable for use in a primary steel production area operating in either direct rolling or direct hot charge rolling modes, collectively referred to as synchronized rolling. The steel production area comprising a continuous caster, for input of slabs to a hot strip mill. An order load for some finite period (e.g. one week) is received as input to the method. The method generates a caster schedule and a hot strip mill schedule which fills the order load with the objective of operating the continuous caster and the hot strip mill with minimal interruption. The generated schedule works within the constraints imposed by both the continuous caster and the hot strip mill. The schedule generation process also considers key operating constraints of individual facilities as well as those on which the facility has dependencies. The schedule also addresses objectives such as maximizing throughput, maximizing on-time delivery, and minimizing operating costs.
摘要翻译： 适用于以直接轧制或直接热轧轧制方式运行的主钢生产区域的调度方法，统称为同步轧制。 钢生产区域包括连铸机，用于将板坯输入热轧机。 作为该方法的输入接收一些有限周期（例如一周）的订单负载。 该方法生成施法者计划和热轧带钢轧机计划，其填充订单负载，以连续铸造机和热轧带钢轧机的操作为中心。 生成的计划在连续铸造机和热轧带钢厂施加的约束条件下工作。 时间表生成过程还考虑了各个设施以及设施依赖关系的关键操作限制。 该计划还涉及目标，例如最大化吞吐量，最大限度地提高准时交货，并最大限度地降低运营成本。
-
-
搜索结果
3 条记录 (耗时 0.015 秒)
