Minimization of the makespan in a two-machine problem under given resource constraints.
Adam JaniakPublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- resource constraints
- flowshop
- batch processing
- scheduling problem
- resource constrained
- scheduling jobs
- minimizing makespan
- resource availability
- routing problem
- unrelated parallel machines
- temporal constraints
- processing times
- single machine
- strongly np hard
- resource constrained project scheduling problem
- special case
- objective function
- tabu search
- release dates
- integrity constraints
- parallel machines
- sensor networks
- dynamic programming
- cost function
- optimal solution