Pages that link to "Item:Q2366085"
From MaRDI portal
The following pages link to Benchmarks for basic scheduling problems (Q2366085):
Displaying 50 items.
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms (Q887179) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics (Q941559) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
- Cooperative metaheuristics for the permutation flowshop scheduling problem (Q958077) (← links)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- The museum visitor routing problem (Q969135) (← links)
- Minimizing total weighted flow time of a set of jobs with interval processing times (Q969917) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- A parallel multiple reference point approach for multi-objective optimization (Q976459) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A genetic algorithm for flowshop scheduling with multiple objectives (Q1018947) (← links)
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem (Q1027588) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems (Q1038288) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization (Q1041924) (← links)
- An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case (Q1046704) (← links)
- Two branch and bound algorithms for the permutation flow shop problem (Q1266538) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- Constructive heuristic algorithms for the open shop problem (Q1310611) (← links)
- A genetic algorithm for flowshop sequencing (Q1342312) (← links)
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- A tabu search algorithm for the open shop problem (Q1383321) (← links)
- 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)