Volume 20, Issue 1 And 1-2 (IJIEPR 2009)                   IJIEPR 2009, 20(1 And 1-2): 1-10 | Back to browse issues page

XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups. IJIEPR. 2009; 20 (1 and 1-2) :1-10
URL: http://ijiepr.iust.ac.ir/article-1-44-en.html
Abstract:   (11552 Views)

  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. Furthermore, a genetic algorithm has been developed which applies this constructive heuristic to generate initial population. These two proposed solution methods are compared on randomly generated problems. Computational results show a clear superiority of our proposed GA for majority of the test problems.

Full-Text [PDF 226 kb]   (2139 Downloads)    
Type of Study: Research | Subject: Other Related Subject
Received: 2009/08/2 | Accepted: 2014/07/21 | Published: 2014/07/21

Cited by [1] [PDF 96 KB]  (215 Download)
Add your comments about this article : Your username or Email:
CAPTCHA code

© 2018 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb