The assignment problem under categorized jobs

DOI10.1016/0377-2217(83)90312-0zbMath0519.90057OpenAlexW2076602906MaRDI QIDQ1054638

J. Blot

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90312-0

zbMATH Keywords

sortingassignment problemcategorized jobspreprocessing technique

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (9)

BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ A Lagrangean relaxation method for the constrained assignment problem ⋮ Categorized bottleneck-minisum path problems on networks ⋮ Task preference-based bottleneck assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ A lexi-search algorithm for a time minimizing assignment problem. ⋮ A priority based unbalanced time minimization assignment problem ⋮ Bottleneck assignment problems under categorization ⋮ A variant of time minimizing assignment problem

Cites Work

• Solving the Assignment Problem by Relaxation
• A new algorithm for the assignment problem
• The alternating basis algorithm for assignment problems
• The assignment problem with three job categories

This page was built for publication: The assignment problem under categorized jobs