Optimal starting times for a class of single machine scheduling problems with earliness and tardiness penalties.
Milan VlachKarel ZimmermannPublished in: Kybernetika (1997)
Keyphrases
- single machine scheduling problem
- branch and bound algorithm
- single machine
- release times
- processing times
- combinatorial optimization
- dynamic programming
- upper bound
- worst case
- hybrid algorithm
- genetic algorithm
- lower bound
- lagrangian relaxation
- precedence constraints
- resource consumption
- optimal solution
- database systems