Journal
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Volume 53, Issue 3, Pages 944-968Publisher
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2014.948575
Keywords
simulated annealing; multi-objective optimisation; assembly flow shop; machine availability constraint; non-dominated sorting genetic algorithm
Ask authors/readers for more resources
In this paper, a three-stage assembly flow shop scheduling problem with machine availability constraints is taken into account. Two objectives of minimising total weighted completion times (flow time) and minimising sum of weighted tardiness and earliness are simultaneously considered. To describe this problem, a mathematical model is presented. The problem is generalisation of three-machine flow shop scheduling problemand two-stage assembly flow shop scheduling problem. Since these problems are known to be NP-hard, the considered problem is also strongly NP-hard. Therefore, two multi-objective meta-heuristics are presented to efficiently solve this problem in a reasonable amount of time. Comprehensive computational experiments are performed to illustrate the performance of the presented algorithms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available