Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
سال انتشار: 1389
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 910
فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-21-2_005
تاریخ نمایه سازی: 7 شهریور 1393
چکیده مقاله:
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..
کلیدواژه ها:
نویسندگان
Mohammad Mahdavi Mazdeh
Assistant professor of Industrial Eng. Department, Iran University of Science and Technology.
Ali Khan Nakhjavani
BSC student of Industrial Eng. Department, Iran University of Science and Technology.
Abalfazl Zareei
BSC student of Industrial Eng. Department, Iran University of Science and Technology