Makespan minimization flowshop with position dependent job processing times - computational complexity and solution algorithms.
Agnieszka RudekRadoslaw RudekPublished in: Comput. Oper. Res. (2013)
Keyphrases
- makespan minimization
- flowshop
- parallel machines
- scheduling problem
- special case
- computational complexity
- job processing times
- processing times
- job shop scheduling problem
- metaheuristic
- single machine
- polynomially solvable
- np hard
- polynomial time approximation
- np complete
- total weighted tardiness
- optimization problems
- setup times
- benchmark problems
- tabu search
- optimal solution
- combinatorial optimization problems
- sequence dependent setup times
- precedence constraints
- worst case
- ant colony optimization
- error bounds
- combinatorial optimization
- release dates
- memetic algorithm
- genetic algorithm
- lagrangian relaxation
- single server
- approximation algorithms
- hybrid algorithm
- search space
- search algorithm