Reductions between scheduling problems with non-renewable resources and knapsack problems.
Péter GyörgyiTamás KisPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- knapsack problem
- scheduling problem
- np hard
- combinatorial optimization problems
- optimal solution
- test problems
- exact algorithms
- optimization problems
- dynamic programming
- single machine
- processing times
- job shop scheduling problem
- resource allocation
- linear programming relaxation
- resource consumption
- flowshop
- np hard problems
- production planning
- bicriteria
- job shop scheduling
- implicit enumeration
- cutting plane
- sequencing problems
- resource constraints
- np complete
- greedy algorithm
- binary variables
- special case
- greedy heuristics
- computational complexity
- parallel machines
- linear programming
- lower bound