XML Print

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

Kianfar K, Moslehi G. Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs. IJIEPR. 2017; 28 (3)
URL: http://ijiepr.iust.ac.ir/article-1-710-en.html

Assistant Professor Faculty of Engineering, University of Isfahan, 81746-73441, Isfahan, Iran , k.kianfar@eng.ui.ac.ir
Abstract:   (22 Views)

This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with rejection and hence, the results of this study are applicable for them. Initially, we present two approximation algorithms. Then, two special cases of the main problem are considered. In the first case, all jobs have the same tardiness weights where an FPTAS is developed using the technique of “structuring the execution of an algorithm". The second special case occurs when none of the jobs can be early. For this case, a 2-approximation algorithm is developed as well as a dynamic programming algorithm which is converted to an FPTAS.

Full-Text [DOCX 453 kb]   (8 Downloads)    
Type of Study: Research | Subject: Operations Research
Received: 2017/01/18 | Accepted: 2017/07/16 | Published: 2017/07/16

Add your comments about this article : Your username or email:
Write the security code in the box

Send email to the article author

© 2015 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb