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

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

zbMATH Keywords

assignment problemschedulingallocationcombinatorial analysis

Mathematics Subject Classification ID

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

Recommendations

• An improved algorithm for two stage time minimization assignment problem
• A bicriterion machine-assignment problem
• Assignment of jobs to processors in a two-level system
• Bilevel time minimizing assignment problem
• An approximation algorithm for the generalized assignment problem

Cites work

• A linear time algorithm for the maximum capacity path problem
• A note on two problems in connexion with graphs
• An augmenting path method for solving linear bottleneck assignment problems
• Balanced optimization problems
• Bilevel time minimizing assignment problem
• Fibonacci heaps and their uses in improved network optimization algorithms
• 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
• Network flows. Theory, algorithms, and applications.
• On some techniques useful for solution of transportation network problems
• Selected topics on assignment problems

Cited in

(6)

• A bicriterion machine-assignment problem
• Bilevel time minimizing assignment problem
• An improved algorithm for two stage time minimization assignment problem
• Assignment of jobs to processors in a two-level system
• A priority based assignment problem
• Task preference-based bottleneck assignment problem

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)