Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: This work studies the scheduling problem of a single-arm multicluster tool with a linear topology and process-bound bottleneck individual tool. The objective is to find a one-wafer cyclic schedule such that the lor bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net (PN) model is developed to describe the dynamic behavior of the system by extending resource-oriented PNs such that a schedule can be parameterized by robots’ waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with the lor bound of cycle time can be found. With the derived conditions, an algorithm is developed to find such a schedule and optimally configure buffer spaces. The algorithm requires only simple calculation to set the robots’ waiting time and buffer size. Illustrative examples are presented to demonstrate the proposed method.
['Li-Ping Bai', 'NaiQi Wu', 'Zhiwu Li', 'MengChu Zhou']
I am writing a research paper on a idea Optimal One-Wafer Cyclic Scheduling and Buffer Space Configuration for Single-Arm Multicluster Tools With Linear Topology
[{"from": "human", "value": "I am writing a research paper on a idea Optimal One-Wafer Cyclic Scheduling and Buffer Space Configuration for Single-Arm Multicluster Tools With Linear Topology"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: This work studies the scheduling problem of a single-arm multicluster tool with a linear topology and process-bound bottleneck individual tool. The objective is to find a one-wafer cyclic schedule such that the lor bound of cycle time is reached by optimally configuring spaces in buffering modules that link individual cluster tools. A Petri net (PN) model is developed to describe the dynamic behavior of the system by extending resource-oriented PNs such that a schedule can be parameterized by robots\u2019 waiting time. Based on this model, conditions are presented under which a one-wafer cyclic schedule with the lor bound of cycle time can be found. With the derived conditions, an algorithm is developed to find such a schedule and optimally configure buffer spaces. The algorithm requires only simple calculation to set the robots\u2019 waiting time and buffer size. Illustrative examples are presented to demonstrate the proposed method."}]