Scheduling problems with position dependent job processing times: computational complexity results.
Radoslaw RudekPublished in: Ann. Oper. Res. (2012)
Keyphrases
- scheduling problem
- job processing times
- computational complexity
- flowshop
- single machine
- makespan minimization
- processing times
- np hard
- release dates
- special case
- parallel machines
- precedence constraints
- sequence dependent setup times
- tabu search
- np complete
- total weighted tardiness
- job shop
- job shop scheduling problem
- setup times
- job shop scheduling
- computational efficiency
- evolutionary algorithm
- single machine scheduling problem
- optimization problems
- lower bound
- optimal solution