TY - JOUR
ID -
TI - An efficient algorithm to solve 1// ∑Ci+∑Yi problem
AU - Haeder Younis Ghawi
PY - 2011
VL - 3
IS - 2
SP - 1
EP - 9
JO - Journal of Al-Qadisiyah for Computer Science and Mathematics مجلة القادسية لعلوم الحاسوب والرياضيات
SN - 20740204 25213504
AB -
In the problem of scheduling a single machine to minimize the sum of completion time and total late work, there are n jobs to be processed for which each has an integer processing time and a due date. The objective is to minimize the sum of total completion time and total late work ,where the late work for a job is the amount of processing of this job that is performed after its due date. Although dominance rules are derived for the special cases in which all processing times are equal and all due dates are equal. Algorithm H is presented for the general non preemptive sum of completion time and the total late work simultaneous problems
ER -