Pages that link to "Item:Q3220332"
From MaRDI portal
The following pages link to Approximation Algorithms for the Assembly Line Crew Scheduling Problem (Q3220332):
Displaying 16 items.
- Approximating the multi-level bottleneck assignment problem (Q453052) (← links)
- Complexity of workforce scheduling in transfer lines (Q1407252) (← links)
- Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
- Joint mixability of some integer matrices (Q1751157) (← links)
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm (Q1793174) (← links)
- Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
- Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum (Q3343749) (← links)
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines (Q3503545) (← links)
- On the matrix permutation problem (Q3735433) (← links)
- (Q3793924) (← links)
- A heuristic hybrid framework for vector job scheduling (Q4987672) (← links)
- (Q5011445) (← links)
- Algorithms for Finding Copulas Minimizing Convex Functions of Sums (Q5506760) (← links)
- Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
- Workface planning in synchronous production systems (Q5953343) (← links)
- Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations (Q6164589) (← links)
