Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines.
Eric J. AndersonT. S. JayramTracy KimbrelPublished in: Computing (2001)
Keyphrases
- job shop scheduling
- lower bound
- scheduling problem
- upper bound
- flowshop
- job shop scheduling problem
- upper and lower bounds
- single machine
- graph coloring
- np hard
- learning machines
- processing times
- competitive ratio
- branch and bound
- tabu search
- worst case
- resource constraints
- genetic programming
- optimal solution
- genetic algorithm