Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A continuous process simulation using GPSS
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 1
| Hi-index | 0.00 |
The manufacturing of industrial rubber compounds is a three-stage process on a Banbury production system. At each stage the rubber is mixed (in a Banbury mixer) and transferred to next-stage storage. Depending on requirements, the first two stages may be repeated up to three times. Finally, rubber is mixed on the third stage and then milled to obtain a slab form of the new compound rubber.The objective is to derive a “good” heuristic scheduling algorithm that uses a series of sorts, searches, and simulations in order to sequence and route jobs through production stages. Evaluation criteria are based on the increase in equipment utilization and on satisfying quality and operating restrictions. Schedule feasibility will be tested by a GPSS simulation model of the production system.