Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 21، Issue: 2
Publish Year: 1389
نوع سند: مقاله ژورنالی
زبان: English
View: 905
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-21-2_005
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
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:
Authors
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