Toggle Main Menu Toggle Search

Open Access padlockePrints

A Multiple criteria Genetic Algorithm Scheduling Tool for Production Scheduling in the Capital Goods industry

Lookup NU author(s): Professor Christian Hicks, Dr Pupong Pongcharoen

Downloads


Licence

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).


Abstract

Production planners usually aim to satisfy multiple objectives. This paper describes the development of a Genetic Algorithm tool that finds optimum trade-offs between delivery performance, resource utilisation and work-in-progress inventory. The tool was specifically developed to meet the requirements of capital goods companies that manufacture products with deep and complex product structures with components that have long and complicated routings. The model takes into account operation and assembly precedence relationships and finite capacity constraints. The tool was tested using various production problems that were obtained from a collaborating company. A series of experiments showed the tool provides a set of non-dominated solutions that enable the planner to choose an optimum trade-off according to their preferences. Previous research had optimised a single objective function. This is the first scheduling tool of its type that has simultaneously optimised delivery performance, resource utilisation and work-in-progress inventory. The quality of the schedules produced was significantly better than the approaches used by the collaborating company.


Publication metadata

Author(s): Xie W, Hicks C, Pongcharoen P

Publication type: Article

Publication status: Published

Journal: International Journal of Engineering and Technology Innovation

Year: 2014

Volume: 4

Issue: 1

Pages: 18-29

Print publication date: 01/01/2014

Online publication date: 31/12/2013

Acceptance date: 26/10/2013

Date deposited: 22/05/2015

ISSN (electronic): 2277-3754

Publisher: IJETI

URL: http://sparc.nfu.edu.tw/~ijeti/download/V4-no1-18-29.pdf


Share