Pages that link to "Item:Q1296703"
From MaRDI portal
The following pages link to Benchmarks for shop scheduling problems (Q1296703):
Displayed 14 items.
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
- Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351) (← links)
- Using dispatching rules for job shop scheduling with due date-based objectives (Q5444509) (← links)
- Optimal scheduling for flexible job shop operation (Q5466730) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)