Pages that link to "Item:Q2901027"

The following pages link to A review and evaluation of multiobjective algorithms for the flowshop scheduling problem (Q2901027):

Displaying 37 items.

• Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
• An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
• A high performing metaheuristic for multi-objective flowshop scheduling problem (Q337199) (← links)
• Improving the anytime behavior of two-phase local search (Q408982) (← links)
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
• On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
• Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
• Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
• A parallel multiple reference point approach for multi-objective optimization (Q976459) (← links)
• The distributed permutation flowshop scheduling problem (Q1040975) (← links)
• A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
• A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling (Q1652172) (← links)
• Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem (Q1676480) (← links)
• A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
• Bi-objective parallel machine scheduling with additional resources during setups (Q2030593) (← links)
• A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
• Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations (Q2257351) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
• Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization (Q2664442) (← links)
• Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA (Q2669640) (← links)
• Domination Measure: A New Metric for Solving Multiobjective Optimization (Q3386783) (← links)
• Flow shop scheduling under Time-Of-Use electricity tariffs using fuzzy multi-objective linear programming approach (Q5025093) (← links)
• An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem (Q6066726) (← links)
• A review and classification on distributed permutation flowshop scheduling problems (Q6069211) (← links)
• Evaluating the impact of grammar complexity in automatic algorithm design (Q6082176) (← links)
• Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
• A systematic review of multi-objective hybrid flow shop scheduling (Q6112731) (← links)
• An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
• A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)