Formulating a single-machine multi-product capacitated lot-sizing problem via goal programming approach
کد مقاله : 1194-ICIM
نویسندگان
علی خاتمی فیروزآبادی1، مقصود امیری2، محمدتقی تقوی فرد3، نیما فخیم هاشمی *4
1دانشگاه علامه طباطبایی
2استاد-عضو هیات علمی دانشگاه علامه طباطبائی
3دانشیار/عضو هیات علمی
4تهران
چکیده مقاله
Production planning is one of the major problems in the field of operations research and management science. Production planning is defined as "the best use of production resources in order to achieve the production goals". Production planning commonly includes three time intervals for decision-making: long-term, mid-term, and short-term. Lot-sizing is one of the most important and, meanwhile, the most difficult problems in production planning The present paper discusses the lot sizing problem in glass container industry. Glass industry is considered among the capital intensive industries, and thus cost reduction is of great importance for managers in this industry. In the present paper, the CLSP (capacitated lot-sizing problem) with sequence-dependent setup costs and times was formulated as two goals via goal programming approach. Minimizing the sequence-dependent setup cost and minimizing the inventory maintenance cost were considered as the first and second goals, respectively. Subsequently, by assuming the goals as vector b, weights vector as vector W, the solution was described using GA method.
کلیدواژه ها
Multi-objective optimization, Goal programming, Production planning, Glass industry, Capacitated lot-sizing problem
وضعیت: پذیرفته شده برای ارسال فایل های ارائه پوستر
login