Volume 22, Issue 3 (IJIEPM 2011)                   2011, 22(3): 273-281 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Moslehi G, Kianfar K. Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties. Journal title 2011; 22 (3) :273-281
URL: http://ijiepm.iust.ac.ir/article-1-735-en.html
Professor of Industrial Engineering – Isfahan University of Technology , moslehi@cc.iut.ac.ir
Abstract:   (4730 Views)

  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 .

Full-Text [PDF 249 kb]   (2028 Downloads)    
Type of Study: Research | Subject: Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE
Received: 2011/12/11 | Accepted: 2013/07/15 | Published: 2013/07/15

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.