Categorized Assignment Scheduling: a Tabu Search Approach

DOI10.1057/jors.1993.116zbMath0785.90054OpenAlexW2025470203MaRDI QIDQ4273298

Abraham P. Punnen, Yash P. Aneja

Publication date: 2 January 1994

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

Full work available at URL: https://doi.org/10.1057/jors.1993.116

zbMATH Keywords

heuristicstabu searchbottleneck assignmentstrongly NP-completepermutation problemsgreedy principle

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Assignment problems: a golden anniversary survey ⋮ Common due-date determination and sequencing using tabu search ⋮ Metaheuristics: A bibliography ⋮ Minmax combinatorial optimization ⋮ Task preference-based bottleneck assignment problem ⋮ An improved algorithm for two stage time minimization assignment problem ⋮ Multiple bottleneck assignment problem ⋮ Using tabu search to schedule activities of stochastic resource-constrained projects