On a pair of job-machine assignment problems with two stages
From MaRDI portal
Publication:732901
DOI10.1016/J.COR.2009.05.009zbMATH Open1175.90197OpenAlexW2145085016MaRDI QIDQ732901FDOQ732901
Authors: A. Volgenant, Cees Duin
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.009
Recommendations
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- On some techniques useful for solution of transportation network problems
- Selected topics on assignment problems
- Bilevel time minimizing assignment problem
- Finding the upper envelope of n line segments in O(n log n) time
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Balanced optimization problems
- A linear time algorithm for the maximum capacity path problem
- An augmenting path method for solving linear bottleneck assignment problems
Cited In (6)
This page was built for publication: On a pair of job-machine assignment problems with two stages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732901)