جلد 21، شماره 2 - ( 2-1389 )                   جلد 21 شماره 2 صفحات 89-95 | برگشت به فهرست نسخه ها


XML English Abstract 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-fa.html
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1389; 21 (2) :89-95

URL: http://ijiepr.iust.ac.ir/article-1-197-fa.html


چکیده:   (5237 مشاهده)

  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..

     
نوع مطالعه: پژوهشي | موضوع مقاله: و موضوعات مربوط
دریافت: ۱۳۸۹/۹/۱

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
کد امنیتی را در کادر بنویسید

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

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

Designed & Developed by : Yektaweb