On the Complexity of Non-preemptive Shop Scheduling with Two Jobs.
Tamás KisPublished in: Computing (2002)
Keyphrases
- scheduling problem
- processing times
- single machine
- scheduling algorithm
- identical parallel machines
- release dates
- scheduling jobs
- parallel machines
- minimize total
- setup times
- identical machines
- unrelated parallel machines
- precedence constraints
- flowshop
- scheduling strategy
- optimal scheduling
- release times
- job scheduling
- competitive ratio
- scheduling policies
- sequence dependent setup times
- computational grids
- maximum lateness
- precedence relations
- single machine scheduling problem
- weighted tardiness
- deteriorating jobs
- lower bound
- round robin
- space complexity
- strongly np hard
- completion times
- scheduling decisions
- resource allocation
- limited capacity
- response time
- worst case
- computational complexity
- list scheduling
- resource constraints
- fixed number
- decision problems
- np complete
- computational cost