کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
8900889 1631724 2018 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
ترجمه فارسی عنوان
برنامه ریزی با روابط پیشین یا بدون آن در دستگاه سریال سری به منظور به حداقل رساندن مبلغ و حداکثر هزینه
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
چکیده انگلیسی
In this paper, we consider several scheduling problems on a serial-batch machine for scheduling jobs with or without precedence relations. Under the serial-batch setting, the jobs in a batch are processed in succession and are removed until the last job in this batch finishes its processing. Thus, the processing time of a batch is equal to the sum of processing times of jobs in the batch. When a new batch starts, a constant setup time is required for the machine. The objectives of the problems involve minimizing makespan and a maximum cost. For these problems, we either present polynomial-time algorithms to generate all Pareto optimal points and find a corresponding Pareto optimal schedule for each Pareto optimal point, or give the strong NP-hardness proof. Experimentation results show that the proposed algorithms for the considered problems are very efficient.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 332, 1 September 2018, Pages 1-18
نویسندگان
, , ,