Pages that link to "Item:Q1768611"
From MaRDI portal
The following pages link to A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems (Q1768611):
Displaying 24 items.
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- A composite algorithm for multiprocessor scheduling (Q544815) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
- Partial solutions and multifit algorithm for multiprocessor scheduling (Q894528) (← links)
- Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
