Pages that link to "Item:Q2366085"
From MaRDI portal
The following pages link to Benchmarks for basic scheduling problems (Q2366085):
Displayed 50 items.
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. (Q1427562) (← links)
- An ant colony system for permutation flow-shop sequencing (Q1433172) (← links)
- A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
- Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- The permutation flow shop with buffers: A tabu search approach (Q1610144) (← links)
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking (Q1615967) (← links)
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last (Q1617387) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
- Trade-off balancing in scheduling for flow shop production and perioperative processes (Q1631497) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion (Q1652026) (← links)
- An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes (Q1652033) (← links)
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem (Q1652233) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell (Q1652331) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (Q1694317) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem (Q1725819) (← 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)
- Task scheduling in distributed real-time systems (Q1745808) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- Decomposition algorithms for synchronous flow shop problems with additional resources and setup times (Q1751897) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
- On single-walk parallelization of the job shop problem solving algorithms (Q1761161) (← links)
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan (Q1761237) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- A self-guided genetic algorithm for permutation flowshop scheduling problems (Q1762134) (← links)
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling (Q1764767) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)