Volume 21, Issue 2 (IJIEPR 2010)                   IJIEPR 2010, 21(2): 89-95 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Mahdavi Mazdeh M, Khan Nakhjavani A, Zareei A. Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem. IJIEPR 2010; 21 (2) :89-95
URL: http://ijiepr.iust.ac.ir/article-1-197-en.html
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
Mohammad Mahdavi Mazdeh 1, Ali Khan Nakhjavani , Abalfazl Zareei
1- , mazdeh@iust.ac.ir
Abstract:   (11160 Views)

  This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic algorithms are designed for the problem based on Tabu search mechanism. Extensive numerical experiments were conducted to observe and compare the behavior of the algorithms in solving the problem..

Keywords: Total Weighted Tardiness, Single machines, due date, heuristic algorithms
Full-Text [PDF 230 kb]   (3718 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2010/11/22 | Published: 2010/05/15
Add your comments about this article : Your username or Email:
CAPTCHA
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.