کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
474933 699176 2005 20 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Two-machine flowshop scheduling with job class setups to minimize total flowtime
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Two-machine flowshop scheduling with job class setups to minimize total flowtime
چکیده انگلیسی

This paper studies the two-machine flowshop scheduling problem with job class setups to minimize the total flowtime. The jobs are classified into classes, and a setup is required on a machine if it switches processing of jobs from one class to another class, but no setup is required if the jobs are from the same class. For some special cases, we derive a number of properties of the optimal solution, based on which we design heuristics and branch-and-bound algorithms to solve these problems. Computational results show that these algorithms are effective in yielding near-optimal or optimal solutions to the tested problems.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 32, Issue 11, November 2005, Pages 2751–2770
نویسندگان
, ,