کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482482 | 1446214 | 2006 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A complex time based construction heuristic for batch scheduling problems in the chemical industry
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A complex time based construction heuristic for batch scheduling problems in the chemical industry A complex time based construction heuristic for batch scheduling problems in the chemical industry](/preview/png/482482.png)
چکیده انگلیسی
In this paper we investigate a heuristic for batch processing problems occurring in the chemical industry, where the objective is to minimize the makespan. Usually, this kind of problem is solved using mixed-integer linear programs. However, due to the large number of binary variables good results within a reasonable computational time could only be obtained for small instances.We propose an iterative construction algorithm which alternates between construction and deconstruction phases. Moreover, we suggest diversification and intensification strategies in order to obtain good suboptimal solutions within moderate running times. Computational results show the power of this algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 174, Issue 2, 16 October 2006, Pages 1162–1183
Journal: European Journal of Operational Research - Volume 174, Issue 2, 16 October 2006, Pages 1162–1183
نویسندگان
Rainer E. Burkard, Johannes Hatzl,