The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
Publish place: International Journal of Industrial Engineering & Production Research، Vol: 20، Issue: 1
Publish Year: 1388
نوع سند: مقاله ژورنالی
زبان: English
View: 504
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-20-1_001
تاریخ نمایه سازی: 7 شهریور 1393
Abstract:
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic method to solve the problem in sequence dependent case. urthermore, agenetic algorithm has been developed which applies this constructiveheuristic to generate initial population. These two proposed solutionmethods are compared on randomly generated problems. Computationalresults show a clear superiority of our proposed GA for majority of thetest problems.
Keywords:
Economic lot scheduling problem , Sequence-dependent , Finite horizon , Genetic Algorithm , Mixed zero-one nonlinear programming
Authors
M. Heydari
Industrial Engineering Department, Amirkabir University of technology, Tehran ,Iran
B. Karimi
Industrial Engineering Department, Amirkabir University of technology, Tehran, Iran
S.A. Torabi
Industrial Engineering Department, College of Engineering, University of Tehran, Tehran, Iran