Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times Online publication date: Sat, 07-Jan-2017
by Saeed Behjat; Nasser Salmasi
European J. of Industrial Engineering (EJIE), Vol. 11, No. 1, 2017
Abstract: In this research, the no-wait flowshop sequence dependent group scheduling problem with minimisation of total completion time, noted as Fm|nwt, fmls, Splk|ΣCj is approached. A mixed integer linear mathematical model is proposed for the research problem. Due to the NP-hard nature of the proposed problem, several metaheuristic algorithms based on particle swarm optimisation and variable neighbourhood search with different neighbourhood search structures are proposed to heuristically solve the problem. Also, an efficient heuristic algorithm is proposed to generate the initial feasible solutions for the proposed algorithms. The performances of the proposed algorithms are compared with each other and the best available one in the literature by using available test problems in the literature. Based on the results, the proposed metaheuristics with structure oriented initial solutions have a better performance than the algorithms with random-generated initial solutions. [Received 14 July 2015; Revised 22 September 2015; Accepted 30 May 2016]
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 European J. of Industrial Engineering (EJIE):
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