en و موضوعات مربوط Other Related Subject پژوهشي Research <p> <i> 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.. </i></p> Total Weighted Tardiness, Single machines, due date, heuristic algorithms 89 95 http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1-117&slc_lang=en&sid=1 Mohammad Mahdavi Mazdeh mazdeh@iust.ac.ir 18003194753284600604 18003194753284600604 Yes Ali Khan Nakhjavani 18003194753284600678 18003194753284600678 No Abalfazl Zareei 18003194753284600679 18003194753284600679 No