An efficient scatter search algorithm for minimizing earliness and tardiness penalties in a single-machine scheduling problem with a common due date.
J. TalebiH. BadriF. GhaderiE. KhosravianPublished in: IEEE Congress on Evolutionary Computation (2009)
Keyphrases
- single machine scheduling problem
- search algorithm
- completion times
- branch and bound algorithm
- search procedure
- weighted tardiness
- sequence dependent setup times
- branch and bound
- release dates
- single machine
- processing times
- precedence constraints
- combinatorial optimization
- hybrid algorithm
- resource consumption
- search space
- upper bound
- scheduling problem
- worst case