Pages that link to "Item:Q1885958"
From MaRDI portal
The following pages link to A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958):
Displayed 38 items.
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- A real-time order acceptance and scheduling approach for permutation flow shop problems (Q320020) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- A multiperiod single processor scheduling problem with periodic requirements (Q818097) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search (Q868140) (← links)
- Considering scheduling and preventive maintenance in the flowshop sequencing problem (Q883296) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times (Q958443) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
- Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← 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)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Some local search algorithms for no-wait flow-shop problem with makespan criterion (Q2387266) (← links)
- Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- Supercomputer Scheduling with Combined Evolutionary Techniques (Q3603111) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- Similarities between meta-heuristics algorithms and the science of life (Q5965643) (← links)
- (Q6117540) (← links)
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect (Q6191395) (← links)