Local search algorithms for a single-machine scheduling problem with positive and negative time-lags.
Johann L. HurinkJens KeuchelPublished in: Discret. Appl. Math. (2001)
Keyphrases
- positive and negative
- single machine scheduling problem
- search algorithm
- branch and bound algorithm
- search procedure
- branch and bound
- weighted tardiness
- release dates
- single machine
- processing times
- positive or negative
- combinatorial optimization
- decision rules
- search space
- tabu search
- precedence constraints
- lagrangian relaxation
- neural network
- dynamic programming
- column generation
- resource consumption
- lower bound
- objective function