عرض بسيط للتسجيلة

المؤلفAl Salem, Ameer
المؤلفArmacost, Robert L.
تاريخ الإتاحة2009-11-25T13:07:13Z
تاريخ النشر2002
اسم المنشورEngineering Journal of Qatar University
الاقتباسEngineering Journal of Qatar University, 2002, Vol. 15, Pages 193-210.
معرّف المصادر الموحدhttp://hdl.handle.net/10576/8020
الملخصIn this paper we present a new heuristic algorithm to minimize the makespan for scheduling jobs on unrelated parallel machines with machine eligibility restrictions ( R^ I M .1 C^^). To the best of our knowledge, the problem has not been addressed previously in the literature. The multi-phase heuristic algorithm incorporates new concepts from the multi-depot vehicle routing in the constructive heuristic. A computational study includes problems with two or four machines, up to 105 jobs, and three levels of a machine selection parameter. The heuristic algorithm solution values are compared to optimal solution values. The results show that the heuristic algorithm can yield solutions within a few percent of the optimal solutions with performance improving as the number of jobs to be scheduled increases.
اللغةen
الناشرQatar University
الموضوعEngineering: Mechanical Engineering
العنوانUnrelated Machines Scheduling With Machine Eligibility Restrictions
النوعArticle
الصفحات193-210
رقم المجلد15
dc.accessType Open Access


الملفات في هذه التسجيلة

Thumbnail

هذه التسجيلة تظهر في المجموعات التالية

عرض بسيط للتسجيلة