Pages that link to "Item:Q1342105"
From MaRDI portal
The following pages link to Applying tabu search with influential diversification to multiprocessor scheduling (Q1342105):
Displaying 22 items.
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups (Q1296704) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem (Q1362971) (← links)
- Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
- A tabu search algorithm for parallel machine total tardiness problem (Q1765548) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- A tabu search algorithm for structural software testing (Q2482359) (← links)
- Minimizing labor requirements in a periodic vehicle loading problem (Q2490369) (← links)
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Machine scheduling models in environmentally focused chemical manufacturing (Q4230056) (← links)
- Scheduling using tabu search methods with intensification and diversification (Q5945316) (← links)
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663) (← links)