公开(公告)号：US20050154625A1

公开(公告)日：2005-07-14

申请号：US10758468

申请日：2004-01-14

申请人： Tay Chua ,  Xiaofeng Yin ,  Juping Zhu ,  Tianxiang Cai

发明人： Tay Chua ,  Xiaofeng Yin ,  Juping Zhu ,  Tianxiang Cai

IPC分类号： G06Q10/00 ,  G06F17/60

CPC分类号： G06Q10/06

摘要： In a method, device, and computer-readable medium for finite capacity scheduling, heuristic rules are applied in two integrated stages: Job Prioritization and Machine Selection. During Job Prioritization (“JP”), jobs are prioritized based on a set of JP rules which are machine independent. During Machine Selection (“MS”), jobs are scheduled for execution at machines that are deemed to be best suited based on a set of MS rules. The two-stage approach allows scheduling goals to be achieved for performance measures relating to both jobs and machines. For example, machine utilization may be improved while product cycle time objectives are still met. Two user-configurable options, namely scheduling model (job shop or flow shop) and scheduling methodology (forward, backward, or bottleneck), govern the scheduling process. A memory may store a three-dimensional linked list data structure for use in scheduling work orders for execution at machines assigned to work centers.

摘要翻译： 在有限容量调度的方法，设备和计算机可读介质中，启发式规则被应用于两个集成阶段：作业优先级和机器选择。 在工作优先级（“JP”）期间，根据与机器无关的一组JP规则优先考虑作业。 在机器选择（“MS”）期间，作业计划在基于一组MS规则被认为最适合的机器上执行。 两阶段方法允许为与作业和机器相关的性能测量实现调度目标。 例如，可以提高机器利用率，而产品周期时间目标仍然满足。 两个用户可配置的选项，即调度模型（作业车间或流程车间）和调度方法（前向，后向或瓶颈），用于调度进程。 存储器可以存储三维链表数据结构，以用于调度分配给工作中心的机器执行的工作订单。

公开(公告)号：US20050096770A1

公开(公告)日：2005-05-05

申请号：US10979069

申请日：2004-11-01

申请人： Tay Chua ,  Tian Cai ,  Ming Liu ,  Feng Wang

发明人： Tay Chua ,  Tian Cai ,  Ming Liu ,  Feng Wang

IPC分类号： G05B19/418 ,  G06F19/00 ,  G06Q10/00

CPC分类号： G06Q10/06 ,  G05B19/41865 ,  G05B2219/32258 ,  G05B2219/32269 ,  G05B2219/32309 ,  Y02P90/20 ,  Y02P90/86

摘要： To schedule the release of jobs from a pool of pending jobs, machine information and information about items to be processed are used to determine available machine capacity. Available machine capacity is allocated to jobs subject to multiple job release constraints. Allocation may be performed first for any pending jobs which were partially released during a previous time interval, and then to new jobs in decreasing order of determined job rank. If different operative constraints dictate different numbers of units of a job to be released, the minimum number of units meeting each constraint may be released. After the number of units to be released has been determined for a job, machine information is updated to account for available capacity consumed by the release of the selected number of units of the job. Updated information may be used for job release scheduling of the next job.

摘要翻译： 要计划从待处理作业池中释放作业，将使用机器信息和有关要处理的项目的信息来确定可用的机器容量。 可用的机器容量分配给受到多个作业发布约束的作业。 可以首先对先前时间间隔内部分释放的待处理作业进行分配，然后按确定的作业等级降序排列新作业。 如果不同的操作限制规定要释放的作业的单位数量不同，则可以释放满足每个约束的最小单位数。 在为作业确定要发布的单位数量之后，更新机器信息以考虑释放所选择的作业单元数量所消耗的可用容量。 更新的信息可用于下一个作业的作业发布调度。

公开(公告)号：US20050114202A1

公开(公告)日：2005-05-26

申请号：US10977393

申请日：2004-10-29

申请人： Tay Chua ,  Feng Wang ,  Wen Yan ,  Tian Cai

发明人： Tay Chua ,  Feng Wang ,  Wen Yan ,  Tian Cai

IPC分类号： G06Q10/00 ,  G06F15/173 ,  G06F17/60

CPC分类号： G06Q10/06 ,  Y02P90/86

摘要： To assess the sufficiency of a plurality of machines for processing a number of items, machine availability information indicative of availability of the machines for processing the items, machine capacity information indicative of a capacity of each of the machines for processing the items, and machine preference information indicative of a preference of each of the machines for processing the items are obtained. A capacity constraint, such as an upper limit of items to be processed during a time interval, is determined based on the machine availability information, machine capacity information and machine preference information. At least some of the machines are allocated to process at least some of the items based on the machine availability information, machine capacity information and machine preference information, subject to the capacity constraint. The resulting rough-cut capacity plan may be used to balance available capacity against required capacity.

摘要翻译： 为了评估用于处理多个物品的多个机器的充足性，指示用于处理物品的机器的可用性的机器可用性信息，指示用于处理物品的每个机器的容量的机器容量信息和机器偏好 获得指示用于处理物品的每个机器的偏好的信息。 基于机器可用性信息，机器容量信息和机器偏好信息来确定诸如在时间间隔期间处理的项目的上限的容量约束。 根据容量约束，至少部分机器被分配以基于机器可用性信息，机器容量信息和机器偏好信息来处理至少一些项目。 所产生的粗切容量计划可用于平衡可用容量与所需容量。