کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
477658 1446174 2008 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Open-shop batch scheduling with identical jobs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Open-shop batch scheduling with identical jobs
چکیده انگلیسی

This paper addresses batch scheduling problems on an m-machine open-shop. The objectives are minimum makespan and minimum flowtime. We assume identical processing time jobs, machine- and sequence-independent setup times and batch availability. The minimum makespan problem is shown to be solved in constant time. Specifically, we show that the optimal number of batches is either m   or n⌊n/m⌋ (where m and n are the number of machines and the number of jobs, respectively). The complexity of the minimum flowtime problem is unknown. We propose an O(n) time algorithm which extends the solution of the single-machine case, and produces close-to-optimal solutions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 187, Issue 3, 16 June 2008, Pages 1282–1292
نویسندگان
, ,