Solving robotic distributed flowshop problem using an improved iterated greedy algorithm
نویسندگان
چکیده
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملAn Iterated Greedy Algorithm for the Flowshop Problem with Sequence Dependent Setup Times
The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...
متن کاملAn iterated greedy algorithm for the flowshop scheduling problem with blocking
This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard’s benchmark instances that are considered to be blocking flows...
متن کاملA simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Over the last decade many metaheuristics have been applied to the flowshop scheduling problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques. Some of these methods provide excellent effectiveness and efficiency at the expense of being utterly complicated. In fact, several published methods require substantial implementation efforts, exploit problem specific speed-...
متن کاملSolving Dock Allocation Problem Using Improved Chemical Reaction Algorithm
Container terminals are places where cargo is transported from point to point using special equipment. One of the most important issues in planning coastal operations at container terminals is the issue of the planning of the embankment or quay, which has a significant impact on crane, yard, warehouse and truck routing programs. This research involved a basin planning model with a multi-pier si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Robotic Systems
سال: 2019
ISSN: 1729-8814,1729-8814
DOI: 10.1177/1729881419879819