A Neutrosophic Set Based Tlbo Algorithm For The Flexible Job Shop Scheduling Problem With Routing Flexibility And Uncertain Processing Times

Download or read book A neutrosophic set-based TLBO algorithm for the flexible job-shop scheduling problem with routing flexibility and uncertain processing times written by Liangliang Jin and published by Infinite Study. This book was released on with total page 21 pages. Available in PDF, EPUB and Kindle. Book excerpt: Different with the plain flexible job-shop scheduling problem (FJSP), the FJSP with routing flexibility is more complex and it can be deemed as the integrated process planning and (job shop) scheduling (IPPS) problem, where the process planning and the job shop scheduling two important functions are considered as a whole and optimized simultaneously to utilize the flexibility in a flexible manufacturing system. Although, many novel meta-heuristics have been introduced to address this problem and corresponding fruitful results have been observed; the dilemma in real-life applications of resultant scheduling schemes stems from the uncertainty or the nondeterminacy in processing times, since the uncertainty in processing times will disturb the predefined scheduling scheme by influencing unfinished operations. As a result, the performance of the manufacturing system will also be deteriorated. Nevertheless, research on such issue has seldom been considered before. This research focuses on the modeling and optimization method of the IPPS problem with uncertain processing times. The neutrosophic set is first introduced to model uncertain processing times. Due to the complexity in the math model, we developed an improved teaching-learning-based optimization(TLBO) algorithm to capture more robust scheduling schemes.