Paper Info
Title
Iterated greedy insertion approaches for the flexible job shop scheduling problem with transportation times constraint.
Abstract
This paper proposes two greedy heuristics based on an iterated insertion technique to solve the flexible job shop scheduling problem with transportation timeu0027s 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 u0027AIP-PRIMECA cell of Valenciennes Universityu0027. 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]
Year
DOI
Venue
2019
10.1504/IJMR.2019.096746
IJMR
Field
DocType
Volume
Integer,Mathematical optimization,Job shop scheduling,Systems engineering,Job shop scheduling problem,Scheduling (computing),Job shop,Heuristics,Linear programming,Engineering,Iterated function
Journal
14
Issue
Citations 
PageRank 
1
1
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Azzedine Bekkar110.34
Ghalem Belalem210630.12
Bouziane Beldjilali3659.29