The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We examine a timed Petri net (TPN) scheduling problem with a time-feasible reachability tree. Scheduling a TPN includes a sequencing decision and a timing decision of transitions. The sequencing decision problem is equivalent to determining a routing order of a token in a conflict place. Each transition usually fires as soon as possible when its sequence is determined because such an earliest firing...
We examine a non-cyclic scheduling problem of a timed Petri net (TPN) with a branch and bound (B&B) algorithm. There have been many approaches and algorithms for conventional scheduling problems such as job shops, resource-constrained project scheduling problems (RCPSPs), and robotized system scheduling problems. Most of these methods have focused on their effectiveness or efficiency in solving...
We examine a scheduling problem regarding cluster tools for small lot production. Most work on scheduling of cluster tools assumed large identical wafer lots, and examined cyclic scheduling that repeats identical work cycles. However, nowadays, the lot size tends to be extremely small, even being only 5–8 wafers whereas conventional lots have 25 identical wafers. It is not reasonable to use cyclic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.