A lexi-search algorithm for a time minimizing assignment problem.
From MaRDI portal
Publication:2468579
DOI10.1007/BF03399215zbMath1141.90459MaRDI QIDQ2468579
Publication date: 25 January 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03399215
Cites Work
- Unnamed Item
- Unnamed Item
- Some special cases of assignment problems
- A state-of-the-art review of parallel-machine scheduling research
- The assignment problem under categorized jobs
- On the bottleneck assignment problem
- Bottleneck assignment problems under categorization
- Some Generalisations of the Time Minimising Assignment Problem
- The assignment problem with three job categories