On a pair of job-machine assignment problems with two stages

DOI10.1016/j.cor.2009.05.009zbMath1175.90197OpenAlexW2145085016MaRDI QIDQ732901

A. Volgenant, Cees W. 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

zbMATH Keywords

schedulingcombinatorial analysisassignment problemallocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items

Task preference-based bottleneck assignment problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Finding the upper envelope of n line segments in O(n log n) time
• Selected topics on assignment problems
• Balanced optimization problems
• A linear time algorithm for the maximum capacity path problem
• Bilevel time minimizing assignment problem
• An augmenting path method for solving linear bottleneck assignment problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• On some techniques useful for solution of transportation network problems