Iterated greedy insertion approaches for the flexible job shop scheduling problem with transportation times constraint Online publication date: Mon, 10-Dec-2018
by Azzedine Bekkar; Ghalem Belalem; Bouziane Beldjilali
International Journal of Manufacturing Research (IJMR), Vol. 14, No. 1, 2019
Abstract: This paper proposes two greedy heuristics based on an iterated insertion technique to solve the flexible job shop scheduling problem with transportation time's constraint. The approaches treat the two sub-problems of: the assignment of machines to operations and the sequencing of the operations on the assigned machines. The idea is to start with a greedy construction method, then, apply an iterative destroy and recreate algorithm, to minimise the maximal completion time of machines (makespan). The heuristics were tested on a benchmark that considers the transportation times between the machines and based on a real flexible job shop 'AIP-PRIMECA cell of Valenciennes University'. The results of the proposed heuristics are compared with the results of a mixed integer linear program (MILP) and the potential fields (PF) approach. The results obtained are very promising. [Submitted 2 May 2017; Accepted 26 January 2018]
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 Manufacturing Research (IJMR):
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