Pages that link to "Item:Q857333"
From MaRDI portal
The following pages link to A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333):
Displaying 50 items.
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points (Q299921) (← links)
- A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry (Q322535) (← links)
- Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operations (Q323012) (← links)
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Methods for multi-objective optimization: an analysis (Q508908) (← links)
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971) (← links)
- Multiobjective particle swarm optimization with nondominated local and global sets (Q601035) (← links)
- A united search particle swarm optimization algorithm for multiobjective scheduling problem (Q611608) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- A unified framework for population-based metaheuristics (Q646652) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times (Q879286) (← links)
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem (Q933507) (← links)
- Introducing dynamic diversity into a discrete particle swarm optimization (Q955627) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm (Q958545) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Hybrid flexible flowshop problems: models and solution methods (Q1634549) (← links)
- Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem (Q1639843) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
- A two-machine flowshop scheduling problem with precedence constraint on two jobs (Q1701710) (← links)
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482) (← links)
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations (Q1733092) (← links)
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times (Q1735381) (← links)
- A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion (Q1736840) (← links)
- Optimizing version release dates of research and development long-term processes (Q1751861) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Putting continuous metaheuristics to work in binary search spaces (Q2012877) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
