کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
474092 | 698840 | 2008 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times](/preview/png/474092.png)
چکیده انگلیسی
A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 4, April 2008, Pages 1250–1264
Journal: Computers & Operations Research - Volume 35, Issue 4, April 2008, Pages 1250–1264
نویسندگان
Pedro Leite Rocha, Martín Gómez Ravetti, Geraldo Robson Mateus, Panos M. Pardalos,