Pages that link to "Item:Q2366085"
From MaRDI portal
The following pages link to Benchmarks for basic scheduling problems (Q2366085):
Displaying 50 items.
- 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)
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers (Q2489134) (← links)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs (Q2566710) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
- Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation (Q2670518) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem (Q2688574) (← links)
- (Q2741380) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS (Q2911576) (← links)
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
- A study on open shop scheduling to minimise total tardiness (Q2967576) (← links)
- Scheduling job shop problems with sequence-dependent setup times (Q3055268) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- Hybrid simulated annealing with memory: an evolution-based diversification approach (Q3163188) (← links)
- A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling (Q3163237) (← links)
- SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531) (← links)
- Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions (Q3509420) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- Forward Backward Transformation (Q3649623) (← links)
- Discrete Set Handling (Q3649627) (← links)
- Flexible process plans: their value in flexible automation systems (Q4394227) (← links)
- Clingo goes linear constraints over reals and integers (Q4592712) (← links)
- A simulation-based genetic algorithm for inventory optimization in a serial supply chain (Q4669800) (← links)
- Scheduling in flowshops to minimize total tardiness of jobs (Q4671257) (← links)
- Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)
- Train Scheduling with Hybrid Answer Set Programming (Q4957222) (← links)
- Permutation, no-wait, no-idle flow shop problems (Q4971620) (← links)
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues (Q4979992) (← links)
- A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
- (Q5020564) (← links)