Meta-heuristic approaches for flowshop scheduling problems: a review Online publication date: Fri, 29-Apr-2016
by Deepanshu Arora; Gopal Agarwal
International Journal of Advanced Operations Management (IJAOM), Vol. 8, No. 1, 2016
Abstract: The right approach towards the optimisation of multi-objective nonlinear problem is the incremental adoption of available techniques and strategies that help to minimise the solution time and to improve the optimised results. Meta-heuristics are heuristic methods that help the search through the solution space using algorithms. Meta-heuristics further improve the solution that comes initially from heuristics. This paper presents various types of meta-heuristics approaches for optimising flowshop scheduling (FSS) with focus on minimising parameters like total tardiness, total earliness, maximum makespan, total no. of tardy jobs, etc. Since the problem is NP-hard, the meta-heuristics and hybrid meta-heuristics are most appropriate methods to solve this kind of problem. Meta-heuristics are projected as strategic means to achieve the optimum and efficient schedule, with positive impact on cost minimisation (economies of scale) and simultaneously reducing solution time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook