fa سایر موضوعاتی که به مرزهای دانش در مهندسی صنایع و تولید کمک می کند Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE پژوهشي Research <p> <i> Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinations in objective functions. However, minimizing the weighted quadratic earliness and tardiness penalties is considered in this paper. A branch and bound algorithm including some dominance rules, lower bounds and upper bounds is proposed to solve the problem. Finally, the efficiency of proposed method is proved via some test problems . </i></p> Scheduling,single machine,quadratic earliness and tardiness,branch and bound 273 281 http://ijiepm.iust.ac.ir/browse.php?a_code=A-10-495-6&slc_lang=fa&sid=1 Ghasem Moslehi moslehi@cc.iut.ac.ir 180031947532846005268 180031947532846005268 Yes Professor of Industrial Engineering – Isfahan University of Technology Kamran Kianfar 180031947532846005269 180031947532846005269 No PhD student of Industrial Engineering – Isfahan University of Technology