کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
473931 698825 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The two-stage assembly scheduling problem to minimize total completion time with setup times
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
The two-stage assembly scheduling problem to minimize total completion time with setup times
چکیده انگلیسی

We address the two-stage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the available n jobs so that total completion time of all n jobs is minimized. Setup times are treated as separate from processing times. This problem is NP-hard, and therefore we present a dominance relation and propose three heuristics. The heuristics are evaluated based on randomly generated data. One of the proposed heuristics is known to be the best heuristic for the case of zero setup times while another heuristic is known to perform well for such problems. A new version of the latter heuristic, which utilizes the dominance relation, is proposed and shown to perform much better than the other two heuristics.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 36, Issue 10, October 2009, Pages 2740–2747
نویسندگان
, ,