Heuristic algorithms for solving a set of NP-hard single-machine scheduling problems with resource-dependent processing times.
Baruch MorDvir ShabtayLiron YedidsionPublished in: Comput. Ind. Eng. (2021)
Keyphrases
- processing times
- single machine scheduling problem
- polynomially solvable
- scheduling problem
- np hard
- single machine
- precedence constraints
- earliness tardiness
- np complete
- branch and bound algorithm
- special case
- partially ordered
- release times
- resource consumption
- linear programming
- neural network
- scheduling jobs
- release dates
- approximation algorithms
- setup times
- constraint satisfaction problems
- lower bound
- objective function