کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
173992 | 458621 | 2008 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scheduling of multi-product batch plants based upon timed automata models
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی شیمی
مهندسی شیمی (عمومی)
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
This paper reports on the successful application of a recently proposed method for solving scheduling problems by reachability analysis of timed automata. The jobs and the resources are modeled by a set of synchronized timed automata, and the scheduling problem is solved by a cost-optimal symbolic reachability analysis. The analysis searches for a path of states and state transitions from an initial state to a terminal state in which all jobs have been finished. The appeal of the approach is the intuitive and modular graphical modeling, and an efficient solution, as is illustrated here for a well-known case study from the chemical industry.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Chemical Engineering - Volume 32, Issues 1–2, January 2008, Pages 275–291
Journal: Computers & Chemical Engineering - Volume 32, Issues 1–2, January 2008, Pages 275–291
نویسندگان
Sebastian Panek, Sebastian Engell, Subanatarajan Subbiah, Olaf Stursberg,