Please use this identifier to cite or link to this item:
|Title:||Scheduling a single-product reentrant process with uniform processing times||Authors:||Lamba, N.
|Issue Date:||Nov-2000||Citation:||Lamba, N.,Karimi, I.A.,Bhalla, A. (2000-11). Scheduling a single-product reentrant process with uniform processing times. Industrial and Engineering Chemistry Research 39 (11) : 4203-4214. ScholarBank@NUS Repository.||Abstract:||Most semiconductor manufacturing involves multiple stages of batch/semicontinuous physico-chemical operations. Scheduling of such plants becomes complex because of a high degree of reentrancy in their process flows, as different lots/batches as well as different tasks of the same lot compete for time on the various processing units at each stage. Scheduling of a single-product reentrant process with uniform processing times is addressed in this paper. First, an analysis of the minimum possible cycle time in such a process is presented. Then, a one-pass heuristic algorithm using a novel priority-based resource-sharing policy is developed. The algorithm is also used to study the impact of the lot release interval on system performance. In comparison to a previous algorithm, the proposed algorithm is much more efficient and gives much better results; thus, it is well suited for a large-scale operation.||Source Title:||Industrial and Engineering Chemistry Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/66793||ISSN:||08885885|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 10, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.