Title of article
A New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Author/Authors
Rashid، R نويسنده Department of Industrial Engineering, Iran University of Science and Technology, Narmak 16844, Tehran, Iran , , Seyedhoseini، S.M. نويسنده Department of Industrial Engineering, Iran University of Science and Technology, Narmak, 16844 Tehran, Iran , , Bozorgi-Amiri، A نويسنده Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran ,
Issue Information
فصلنامه با شماره پیاپی 18 سال 2015
Pages
9
From page
39
To page
47
Abstract
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.
Journal title
International Journal of Applied Operational Research
Serial Year
2015
Journal title
International Journal of Applied Operational Research
Record number
2388524
Link To Document