The assignment problem with three job categories

DOI10.21136/CPM.1971.117707zbMATH Open0208.45702OpenAlexW2569774486MaRDI QIDQ5608992FDOQ5608992

Authors:

Publication date: 1971

Full work available at URL: https://eudml.org/doc/21073

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Graph theory (05C99) Discrete location and assignment (90B80)

Cited In (8)

• A lexi-search algorithm for a time minimizing assignment problem.
• Bottleneck assignment problems under categorization
• A variant of time minimizing assignment problem
• BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
• A priority based unbalanced time minimization assignment problem
• The assignment problem under categorized jobs
• An improved algorithm for two stage time minimization assignment problem
• Experimental comparisons of codes for long transportation problems

This page was built for publication: The assignment problem with three job categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5608992)