A multi-objective coincidence memetic algorithm for a mixed-model U-line sequencing problem
by Parames Chutima, Noppon Kampirom
International Journal of Advanced Operations Management (IJAOM), Vol. 2, No. 3/4, 2010

Abstract: A mixed-model U-line (MMUL) is a type of just-in-time (JIT) production systems where varieties of product models with similar product characteristics are assembled. Sequencing of product models to the MMUL is crucial to achieve the main benefits of JIT, i.e., set-up time reduction and levelled workload. In this paper, a new algorithm, namely combinatorial optimisation with coincidence plus memetic algorithm (COIN-MA), is proposed to find Pareto-optimal solutions for mixed-model sequencing problems. The performances of COIN-MA are compared with NSGA II, MNSGA II, and COIN against the metrics of convergence, spread, ratio of Pareto-optimal solutions, and CPU time. COIN-MA shows several outstanding characteristics against the others.

Online publication date: Fri, 28-Jan-2011

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Operations Management (IJAOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com