A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production
سال انتشار: 1389
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 799
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-21-2_006
تاریخ نمایه سازی: 7 شهریور 1393
چکیده مقاله:
In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapted genetic algorithm based on bypass consideration to solve the problem. The basic parameters of this meta-heuristic are briefly discussed in this paper. Also a computational experiment is conducted to evaluate the performance of the implemented methods. The implemented algorithm can be used to solve large scale flow shop scheduling problem with bypass effectively.
کلیدواژه ها:
نویسندگان
R. Ramezanian
MSc in Department of Industrial Engineering, Iran University of Science and Technology
M.B. Aryanezhad
Professor in Department of Industrial Engineering, Iran University of Science and Technology.
M. Heydari
Assistant Professor in Department of Industrial Engineering, Iran University of Science and Technology.