A new improved NEH heuristic for permutation flowshop scheduling problems
نویسندگان
چکیده
منابع مشابه
A New Improved NEH Heuristic for Permutation Flowshop Scheduling Problems
Job evaluation and differentiation are crucial in scheduling. Since jobs can be represented by vectors of processing times, the average, standard deviation, and skewness of job processing times can be defined as the moments of their probability distribution. The first and the second moments of processing times are effective in sorting jobs (Dong et al., 2008), however they are not yet optimized...
متن کاملAn improved heuristic for permutation flowshop scheduling
Flowshop scheduling deals with determination of optimum sequence of jobs to be processed on some machines in a fixed order so as to satisfy certain scheduling criteria. The general problem of scheduling has been shown to be NP-complete. Exact algorithms, such as integer programming and branch-and-bound, guarantee optimality but do not yield the optimum solution in polynomial time even for probl...
متن کاملAn NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems
Distributed Permutation Flowshop Scheduling Problem (DPFSP) is a newly proposed scheduling problem with a strong engineering background. Whereas there is a body of work on scheduling problems in the past decades, the literature on DPFSPs is scant and in its infancy. Motivated by the good performances of some heuristics in a very recent work, we propose a constructive heuristic algorithm enhance...
متن کاملA New Heuristic-em for Permutation Flowshop Scheduling
This paper applies the new developed heuristic electromagnetism-like mechanism (EM) algorithm for the permutation flowshop scheduling problem. This algorithm simulates the electromagnetism theory by considering each solution as an electrical charge. Through the attraction-repulsion of the charges, solutions move to the optimality without being trapped into local optima. We make use of random ke...
متن کاملA PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Economics
سال: 2017
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2017.06.026