کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1136610 | 1489137 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines](/preview/png/1136610.png)
چکیده انگلیسی
This paper compares the efficacy of a newly developed network-based mixed-integer programming (MIP) formulation with three existing formulations for the sequence dependent setup scheduling problem with earliness/tardiness penalties. This research shows that the new model is more efficient in terms of computation time for larger multi-machine problems than the existing formulations of these problems. The mixed-integer nature of the formulation allows companies to solve this class of problems with any one of many commonly available integer programming software packages. The presented MIP formulation provides a unique and useful method of conceptualizing and modeling a practical, yet difficult, problem within industry.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Mathematical and Computer Modelling - Volume 57, Issues 3–4, February 2013, Pages 483–493
Journal: Mathematical and Computer Modelling - Volume 57, Issues 3–4, February 2013, Pages 483–493
نویسندگان
Bradley E. Anderson, James D. Blocher, Kurt M. Bretthauer, Munirpallam A. Venkataramanan,