Near-optimal solutions and tight lower bounds for the parallel machines scheduling problem with learning effect.
Lotfi HidriMahdi JemmaliPublished in: RAIRO Oper. Res. (2020)
Keyphrases
- scheduling problem
- parallel machines
- lower bound
- learning effect
- single machine
- np hard
- total tardiness
- upper bound
- optimal solution
- sequence dependent setup times
- unrelated parallel machines
- branch and bound algorithm
- scheduling jobs
- flowshop
- precedence constraints
- processing times
- setup times
- maximum lateness
- single machine scheduling problem
- worst case
- competitive ratio
- release dates
- objective function
- learning curve
- branch and bound
- tabu search
- strongly np hard
- single server
- approximation algorithms
- feasible solution
- lagrangian relaxation
- total cost
- evolutionary algorithm
- search space
- e learning