Ranking assignments in order of increasing completion time

DOI10.1080/02331938008842672zbMath0455.90061OpenAlexW2036730985MaRDI QIDQ3904380

H. C. Bakhshi, H. L. Bhatia, Munish C. Puri

Publication date: 1980

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938008842672

zbMATH Keywords

bottleneck assignment problemincreasing completion timek-th best assignmentMurty's cost ranking procedureranking of assignmentssearching for an alternating cycletime ranking

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (1)

BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM

This page was built for publication: Ranking assignments in order of increasing completion time