A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of a Three-Agent Scheduling Problem Considering the Overlap Effect and Environmental Protection.
Jen-Ya WangPublished in: IEEE Access (2019)
Keyphrases
- total tardiness
- branch and bound algorithm
- scheduling problem
- environmental protection
- np hard
- precedence constraints
- single machine scheduling problem
- single machine
- sequence dependent setup times
- setup times
- lower bound
- parallel machines
- flowshop
- completion times
- branch and bound
- optimal solution
- upper bound
- release dates
- lagrangian relaxation
- combinatorial optimization
- tabu search
- processing times
- special case
- sustainable development
- strongly np hard
- integer programming
- approximation algorithms
- linear programming
- optimization problems
- correlation analysis
- resource allocation
- solution quality
- computational complexity
- neural network