System integration based on time-dependent periodic complexity

Data processing: generic control systems or specific application – Specific application – apparatus or process – Product assembly or manufacturing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C700S096000, C709S241000, C709S241000

Reexamination Certificate

active

06701205

ABSTRACT:

FIELD OF THE INVENTION
The invention relates to system integration, and more specifically to scheduling subsystems having independent processing machines.
BACKGROUND OF THE INVENTION
A “system” for purposes hereof is an integrated entity that includes two or more subsystems. Examples of systems include parts-manufacturing systems, semiconductor-fabrication facilities, and retailer supply-chain systems. Subsystems can be, for example, machines, robots, transport systems, people and software modules. System integration includes the process of coupling subsystems so that the resulting system achieves a set of functional requirements.
System integration can be a difficult task if the subsystems are obtained from different sources or vendors, or are otherwise not fully compatible. Additional integration challenges arise if the processing machines or processing stations of the subsystems have random process time variations. In particular, if two or more subsystems perform processes with different fluctuating cycle times, the scheduling of items through the system becomes more difficult with increasing time. The increase in the number of possible processing scenarios due to this time-dependent combinatorial complexity results in increasing uncertainty in time. Ad hoc approaches based on prior experience are typically used to deal with systems having time-dependent combinatorial complexity. Even in such systems, however, combinatorial expansion can eventually lead to operation in a chaotic state or even total system failure.
SUMMARY OF THE INVENTION
The present invention relates to system integration for systems having independent subsystems. The subsystems can include processing stations or machines that can have varying processing times. The invention increases system reliability by converting systems having time-dependent combinatorial complexity into systems having time-dependent periodic complexity.
One aspect of the invention relates to a method of managing a processing system having a plurality of functional requirements. The method includes the steps of determining a time to completion for each of a plurality of processes in a current period, determining a wait (or buffer) time for each process in the current period, determining a system period in response to the times to completion and the wait times, and initializing the functional requirements based on the system period. In one embodiment the step of initializing the functional requirements is performed at the expiration of the system period. In another embodiment the step of initializing the functional requirements is performed at the occurrence of a key functional requirement.
Another aspect of the invention relates to a system for processing items according to a plurality of processing tasks. Each of the processing tasks is performed at a processing station, or machine. The system includes a monitor module in communication with the processing station to determine a completion time for each processing task in a current processing period. The system also includes a processor that communicates with the monitor module. The processor determines wait times for each processing task in response to the completion times. The processor determines a system period in response to the wait times and the completion times. The wait times govern the movement of items among the processing tasks.


REFERENCES:
patent: 4827423 (1989-05-01), Beasley et al.
patent: 5291397 (1994-03-01), Powell
patent: 5826238 (1998-10-01), Chen et al.
patent: 5928389 (1999-07-01), Jevtic
patent: 6201999 (2001-03-01), Jevtic
patent: 6336204 (2002-01-01), Jevtic
patent: 6351686 (2002-02-01), Iwasaki et al.
patent: 6473664 (2002-10-01), Lee et al.
Perkinson et al., “Single-Wafer Cluster Tool Performance: An Analysis of the Effects of Redundant Chambers and Revisitation Sequences on Throughput,”IEEE Transactions on Semiconductor Manufacturing, vol. 9, No. 3, Aug. 1996.
Rostami et al., “An Optimal Scheduling Technique for Dual-arm Robots in Cluster Tools with Residency Constraints,”Proceedings of the 39thIEEE Conference on Decision and Control, Syndney, Australia, Dec. 2000.
Oh et al., “Reducing Complexity of Wafer Flow to Improve Quality and Throughput in a Single-Wafer Cluster Tool,”IEEE/CPMT International Electronics Manufacturing Technology Symposium, 1999.
Chen et al., “Cyclic Scheduling of a Hoist with Time Window Constraints,”IEEE Transactions on Robotics and Automation, vol. 14, No. 1, Feb. 1998.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

System integration based on time-dependent periodic complexity does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System integration based on time-dependent periodic complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System integration based on time-dependent periodic complexity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3277442

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.