RT - Journal Article
T1 - The Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
JF - IUST
YR - 2009
JO - IUST
VO - 20
IS - 1
UR - http://ijiepr.iust.ac.ir/article-1-44-en.html
SP - 1
EP - 10
K1 - Economic lot scheduling problem
K1 - Sequence-dependent
K1 - Finite horizon
K1 - Genetic Algorithm
K1 - Mixed zero-one nonlinear programming
AB - Â 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.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-44-en.html
M3
ER -