کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6897759 | 1446042 | 2013 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Multi-level lot sizing and job shop scheduling with compressible process times: A cutting plane approach
ترجمه فارسی عنوان
برنامه ریزی چندگانه و زمانبندی کار با بارهای فشرده سازی: یک روش برش هواپیما
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
چکیده انگلیسی
This paper proposes an integer linear programming formulation for a simultaneous lot sizing and scheduling problem in a job shop environment. Among others, one of our realistic assumptions is dealing with flexible machines which enable the production manager to change their working speeds. Then, a number of valid inequalities are developed based on problem structures. As the valid inequalities can help in reducing the non-optimal parts of the solution space, they are dealt with as some cutting planes. The proposed cutting planes are used to solve the problem in (i) cut-and-branch, and (ii) branch-and-cut approaches. The performance of each cutting plane is investigated with CPLEX 12.2 on a set of randomly-generated test data. Then, some performance criteria are identified and the proposed cutting planes are ranked by TOPSIS method.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 231, Issue 3, 16 December 2013, Pages 598-616
Journal: European Journal of Operational Research - Volume 231, Issue 3, 16 December 2013, Pages 598-616
نویسندگان
M. Karimi-Nasab, S.M. Seyedhoseini,