Pages that link to "Item:Q2366085"
From MaRDI portal
The following pages link to Benchmarks for basic scheduling problems (Q2366085):
Displayed 50 items.
- 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)
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem (Q1992647) (← links)
- Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion (Q2003413) (← links)
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion (Q2004870) (← links)
- Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
- Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning (Q2077963) (← links)
- Learning to select operators in meta-heuristics: an integration of Q-learning into the iterated greedy algorithm for the permutation flowshop scheduling problem (Q2079447) (← links)
- Using solvable real time classes for jitter-minimized planning (Q2134317) (← links)
- Iterative beam search algorithms for the permutation flowshop (Q2140159) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times (Q2146995) (← links)
- New efficient heuristics for scheduling open shops with makespan minimization (Q2147004) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates (Q2160790) (← links)
- \(\mathrm{PUBO}_i\): a tunable benchmark with variable importance (Q2163799) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852) (← links)
- A cutoff time strategy based on the coupon collector's problem (Q2184095) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (Q2242290) (← 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)
- Flow shop scheduling problem with position-dependent processing times (Q2273687) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion (Q2297561) (← links)
- Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling (Q2331444) (← links)
- A genetic algorithm for scheduling open shops with sequence-dependent setup times (Q2333145) (← links)
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← 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)