Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs.
Alex J. Ruiz-TorresFrancisco J. LópezJohnny C. HoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- number of tardy jobs
- single machine
- processing times
- resource consumption
- single machine scheduling problem
- minimize total
- completion times
- scheduling problem
- flowshop
- resource allocation
- resource constraints
- scheduling algorithm
- branch and bound algorithm
- response time
- dynamic programming
- np hard
- computational complexity
- resource management
- quality of service
- query execution
- simulated annealing
- precedence constraints
- wireless sensor networks
- special case