Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
MM Yenisey, B Yagmahan - Omega, 2014 - Elsevier
The flow shop scheduling problem is finding a sequence given n jobs with same order at m
machines according to certain performance measure (s). The job can be processed on at …
machines according to certain performance measure (s). The job can be processed on at …
Multi-objective optimization algorithms for flow shop scheduling problem: a review and prospects
Y Sun, C Zhang, L Gao, X Wang - The International Journal of Advanced …, 2011 - Springer
Since multi-objective flow shop scheduling problem (MFSP) plays a key role in practical
scheduling, there has been an increasing interest in MFSP according to the literature …
scheduling, there has been an increasing interest in MFSP according to the literature …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
Human–robot collaborative disassembly line balancing problem with stochastic operation time and a solution via multi-objective shuffled frog leaping algorithm
Product disassembly is critically important in recycling end-of-life products, reducing their
negative impact on environmental pollution and minimizing resource waste. Disassembly …
negative impact on environmental pollution and minimizing resource waste. Disassembly …
A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption
D Lei, Y Zheng, X Guo - International Journal of Production …, 2017 - Taylor & Francis
Flexible job shop scheduling problem (FJSP) has been extensively investigated and
objectives are often related to time. Energy-related objective should be considered fully in …
objectives are often related to time. Energy-related objective should be considered fully in …
Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks
Distributed scheduling problems have attracted much attention in recent years; however,
distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated. In this …
distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated. In this …
Variable neighbourhood search: methods and applications
Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
heuristics, based upon systematic changes of neighbourhoods both in descent phase, to …
A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time
Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention;
however, DHFSP with uncertainty and energy-related element is seldom studied. In this …
however, DHFSP with uncertainty and energy-related element is seldom studied. In this …
A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop
Hybrid flow shop scheduling problem has been extensively considered in single factory;
however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated …
however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated …
An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems
J Li, Q Pan, S Xie - Applied Mathematics and Computation, 2012 - Elsevier
In this paper, we propose a hybrid shuffled frog-leaping algorithm (HSFLA) for solving the
multi-objective flexible job shop scheduling problem. Three minimization objectives–the …
multi-objective flexible job shop scheduling problem. Three minimization objectives–the …