Pages that link to "Item:Q632658"
From MaRDI portal
The following pages link to A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658):
Displaying 25 items.
- Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q279989) (← links)
- Anytime Pareto local search (Q319099) (← links)
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas (Q334220) (← links)
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm (Q336334) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization (Q460244) (← links)
- Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm (Q474788) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Region based memetic algorithm for real-parameter optimisation (Q903616) (← links)
- A coordinate-exchange two-phase local search algorithm for the D- and I-optimal designs of split-plot experiments (Q1621406) (← links)
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling (Q1652172) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- Many-objective Pareto local search (Q1653381) (← links)
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem (Q1771205) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
- Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows (Q2147164) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem (Q2664314) (← links)
- P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
- An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time (Q6094378) (← links)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
