Some Generalisations of the Time Minimising Assignment Problem

DOI10.2307/2581536zbMath0463.90071OpenAlexW4253546699MaRDI QIDQ3914763

C. R. Seshan

Publication date: 1981

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581536

zbMATH Keywords

algorithmsbottleneck assignmentindividual job startminimization of total completion timetime minimising assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (16)

BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM ⋮ An algorithm for the committee construction problem ⋮ Categorized bottleneck-minisum path problems on networks ⋮ Assignment problems: a golden anniversary survey ⋮ Bilevel time minimizing assignment problem ⋮ Group centre and group median of a network ⋮ Minmax combinatorial optimization ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ A lexi-search algorithm for a time minimizing assignment problem. ⋮ Traveling salesman problem under categorization ⋮ Minimum perfect bipartite matchings and spanning trees under categorization ⋮ Multiple bottleneck assignment problem ⋮ A priority based unbalanced time minimization assignment problem ⋮ On the solution of a stochastic bottleneck assignment problem and its variations ⋮ Bottleneck assignment problems under categorization ⋮ A variant of time minimizing assignment problem

This page was built for publication: Some Generalisations of the Time Minimising Assignment Problem