Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
From MaRDI portal
Publication:6164589
DOI10.1016/j.cor.2023.106213OpenAlexW4323545770MaRDI QIDQ6164589
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106213
Cites Work
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
- Approximating the multi-level bottleneck assignment problem
- The complete mixability and convex minimization problems with monotone marginal densities
- Optimal solutions for a dock assignment problem with trailer transportation
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem
- Algorithms minimizing mean flow time: Schedule-length properties
- Scheduling with incompatible jobs
- Rearrangement algorithm and maximum entropy
- Block rearranging elements within matrix columns to minimize the variability of the row sums
- Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems
- Exact solution algorithms for the maximum flow problem with additional conflict constraints
- A model-free approach to multivariate option pricing
- An exact algorithm for parallel machine scheduling with conflicts
- Computation of sharp bounds on the distribution of a function of dependent risks
- Joint Mixability
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum
- Assignment Problems
- On the Minimization of the Makespan Subject to Flowtime Optimality
- On minimizing the makespan when some jobs cannot be assigned on the same machine
- Makespan minimization on unrelated parallel machines with a few bags
This page was built for publication: Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations
