Finite capacity scheduling using job prioritization and machine selection

Number of patents in Portfolio can not be more than 2000

United States of America Patent

PATENT NO 7904192
APP PUB NO 20050154625A1
SERIAL NO

10758468

Stats

ATTORNEY / AGENT: (SPONSORED)

Importance

Loading Importance Indicators... loading....

Abstract

See full text

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.

Loading the Abstract Image... loading....

First Claim

See full text

Family

Loading Family data... loading....

Patent Owner(s)

  • AGENCY FOR SCIENCE, TECHNOLOGY AND RESEARCH

International Classification(s)

Inventor(s)

Inventor Name Address # of filed Patents Total Citations
Cai, Tianxiang Singapore, SG 1 104
Chua, Tay Jin Singapore, SG 3 153
Yin, Xiaofeng Singapore, SG 28 112
Zhu, Juping Singapore, SG 1 104

Cited Art Landscape

Load Citation

Patent Citation Ranking

Forward Cite Landscape

Load Citation