Pages that link to "Item:Q2366085"
From MaRDI portal
The following pages link to Benchmarks for basic scheduling problems (Q2366085):
Displayed 50 items.
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking (Q817122) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Learning from planner performance (Q835821) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems (Q856670) (← links)
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- Design of cooperative algorithms for multi-objective optimization: application to the flow-shop scheduling problem. (Abstract of thesis) (Q862824) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- Simple heuristics for scheduling with limited intermediate storage (Q868994) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- On operators and search space topology in multi-objective flow shop scheduling (Q872256) (← links)
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
- A discrete version of particle swarm optimization for flowshop scheduling problems (Q878589) (← links)
- 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)