Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling.
Liron YedidsionDvir ShabtayMoshe KaspiPublished in: Discret. Appl. Math. (2011)
Keyphrases
- complexity analysis
- optimal assignment
- minimize total
- total cost
- single machine
- theoretical analysis
- optimal scheduling
- lower bound
- scheduling problem
- parallel machines
- scheduling algorithm
- first order logic
- computational complexity
- release dates
- resource allocation
- np hard
- dynamic scheduling
- round robin
- real time
- resource consumption
- database
- single machine scheduling problem
- resource utilization
- resource constraints
- information systems
- allocation strategy
- project scheduling
- genetic algorithm