https://scholars.lib.ntu.edu.tw/handle/123456789/309359
標題: | Scheduling Flexible Flow Shops with No Setup Effects | 作者: | SHI-CHUNG CHANG Liao, D.-Y. |
公開日期: | 1994 | 卷: | 10 | 期: | 2 | 起(迄)頁: | 112-122 | 來源出版物: | IEEE Transactions on Robotics and Automation | 摘要: | This paper presents an efficient, optimization model-based approach for scheduling the production of discrete-part, make-to-order type of flexible flow shops, where setup effects are negligible. A nominal scheduling algorithm based on Lagrangian relaxation and minimum cost linear network flow is first developed for scheduling under nominal conditions. Fast rescheduling algorithms that exploit the economic interpretation of the Lagrange multipliers and the network structure of production flows are then proposed for timely adjusting the nominal schedule to cope with disturbances. Numerical results on realistic examples demonstrate that our methodology is quite effective; it generates near-optimal schedules, provides relatively smooth adjustment (i.e., no drastic change from the nominal schedule) for small disturbances, and is computationally efficient. © 1994 IEEE |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0028419491&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/309359 https://www.scopus.com/inward/record.uri?eid=2-s2.0-0028419491&doi=10.1109%2f70.282536&partnerID=40&md5=816f11e6fffff06db3ce679cc31bebb1 |
ISSN: | 1042296X | DOI: | 10.1109/70.282536 | SDG/關鍵字: | Algorithms; Manufacture; Numerical methods; Production engineering; Computationally efficient algorithm; Discrete parts; Flexible flow shops; Lagrangian relaxation; Minimum cost linear network flow; Scheduling |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。