|
|
|
|
a new branch-and-bound for the problem of mean completion time for the single machine with release time
|
|
|
|
|
|
|
|
نویسنده
|
rashid r ,seyedhoseini s.m ,bozorgi-amiri a
|
|
منبع
|
international journal of applied operational research - 2015 - دوره : 5 - شماره : 4 - صفحه:39 -47
|
|
چکیده
|
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. our branch-and-bound has been coded with c++, and the results indicate efficiency of our algorithm and our new optimality conditions.
|
|
کلیدواژه
|
single machine ,release time ,branch-and-bound ,optimality conditions
|
|
آدرس
|
iran university of science and technology, department of industrial engineering, iran university of science and technology, narmak 16844, tehran, iran, ایران, iran university of science and technology, department of industrial engineering, iran university of science and technology, narmak 16844, tehran, iran, ایران, university of tehran, department of industrial engineering, college of engineering, university of tehran, tehran, iran, ایران
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|