An improved genetic algorithm for seru scheduling problem with worker assignment considering lot-splitting
by Ling Shen; Zhe Zhang; Yong Yin
International Journal of Applied Decision Sciences (IJADS), Vol. 14, No. 6, 2021

Abstract: Seru, a production organisation that consists of some equipment and one or more workers that assemble one or more products. It is known as a useful tool in production practice to cope with the volatile environment with diversified demand, short product life cycles and uncertain product types due to its high flexibility and effectiveness. In this paper, we will discuss a seru scheduling problem with worker assignment considering lot-splitting, processing sequence and set-up time. We formulate a mathematical model to minimise the makespan and employ an improved genetic algorithm with strong robustness and global optimisation to solve this complex decision-making problem which is composed of two NP-hard subproblems. In the improved genetic algorithm, three different forms of real number coding are used to express the solution of this complex decision problem accurately at the same time. Then, the crossover and mutation with adaptive probability are adopted to improve the convergence speed and accuracy. Finally, a numerical example is taken and computed to validate the effectiveness of proposed model and algorithm.

Online publication date: Fri, 29-Oct-2021

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 Applied Decision Sciences (IJADS):
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