Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines.
Imed KacemMyriam SahnouneGünter SchmidtPublished in: RAIRO Oper. Res. (2017)
Keyphrases
- particle swarm optimization
- polynomial time approximation
- identical machines
- np hard
- approximation algorithms
- single machine
- error bounds
- scheduling problem
- processing times
- flowshop
- vehicle routing problem
- special case
- lower bound
- computational complexity
- branch and bound algorithm
- bin packing
- minimize total
- linear programming
- reinforcement learning
- integer programming
- minimum cost
- multi source
- single source
- multi item
- optimal solution