专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20050154625A1 Finite capacity scheduling using job prioritization and machine selection 有权
标题翻译：使用作业优先级和机器选择的有限容量调度
公开(公告)号：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规则被认为最适合的机器上执行。两阶段方法允许为与作业和机器相关的性能测量实现调度目标。例如，可以提高机器利用率，而产品周期时间目标仍然满足。两个用户可配置的选项，即调度模型（作业车间或流程车间）和调度方法（前向，后向或瓶颈），用于调度进程。存储器可以存储三维链表数据结构，以用于调度分配给工作中心的机器执行的工作订单。

2. 发明授权

US07904192B2 Finite capacity scheduling using job prioritization and machine selection 有权
标题翻译：使用作业优先级和机器选择的有限容量调度
公开(公告)号：US07904192B2
公开(公告)日：2011-03-08
申请号：US10758468
申请日：2004-01-14
申请人： Tay Jin Chua , Xiaofeng Yin , Juping Zhu , Tianxiang Cai
发明人： Tay Jin Chua , Xiaofeng Yin , Juping Zhu , Tianxiang Cai
IPC分类号： G06F19/00 , G06F17/00 , G06F9/46 , G06Q10/00 , G05B19/418
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规则被认为最适合的机器上执行。两阶段方法允许为与作业和机器相关的性能测量实现调度目标。例如，可以提高机器利用率，而产品周期时间目标仍然满足。两个用户可配置的选项，即调度模型（作业车间或流程车间）和调度方法（前向，后向或瓶颈），用于调度进程。存储器可以存储三维链表数据结构，以用于调度分配给工作中心的机器执行的工作订单。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式