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)
- 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)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- A multipopulation cultural algorithm for the electrical generator scheduling problem (Q1849830) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
- Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841) (← links)
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem (Q2475842) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- A new particle swarm optimization for the open shop scheduling problem (Q2482375) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)