Computational complexity of the single processor makespan minimization problem with release dates and job-dependent learning.
Radoslaw RudekPublished in: J. Oper. Res. Soc. (2014)
Keyphrases
- release dates
- makespan minimization
- parallel machines
- processing times
- single machine
- single processor
- scheduling problem
- single machine scheduling problem
- computational complexity
- total weighted tardiness
- special case
- metaheuristic
- reinforcement learning
- precedence constraints
- sequence dependent setup times
- upper bound
- flowshop