Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm.
Kuo-Ching YingPublished in: Comput. Ind. Eng. (2008)
Keyphrases
- single machine scheduling problem
- earliness tardiness
- search algorithm
- search procedure
- branch and bound algorithm
- release dates
- single machine
- branch and bound
- processing times
- precedence constraints
- scheduling problem
- combinatorial optimization
- search space
- resource consumption
- tabu search
- lagrangian relaxation
- lower bound
- parallel machines
- genetic algorithm