A Single Machine Sequencing Problem with Idle Insert: Simulated Annealing and Branch-and-Bound Methods
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 19، Issue: 4
Publish Year: 1387
نوع سند: مقاله ژورنالی
زبان: English
View: 628
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-19-4_006
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a specialdesign of a simulated annealing (SA) method is applied to solve such a hard problem. To compare the associated results, a branch-and-bound (B&B) method is designed and the upper/lower limits are also introduced in this method. To show the effectiveness of these methods, a number of different types of problems are generated and then solved. Based on the results of the test problems, the proposed SA has a small error, and computational time for achieving the best result is very small.
Keywords:
Authors
R. Tavakkoli-Moghaddam
The Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
M. Vasei
The Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran