A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights.
Anjulika GuptaPrabha SharmaHemant SalwanPublished in: EURO J. Comput. Optim. (2018)
Keyphrases
- deteriorating jobs
- maximum tardiness
- weighted sum
- minimizing makespan
- search algorithm
- scheduling problem
- single machine
- flowshop
- linear combination
- maximum lateness
- optimal solution
- search space
- objective function
- branch and bound
- tabu search
- np hard
- lower bound
- computational complexity
- dynamic programming
- parallel machines