A memetic algorithm for the total tardiness single machine scheduling problem.
Paulo M. FrançaAlexandre MendesPablo MoscatoPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- memetic algorithm
- single machine scheduling problem
- total tardiness
- combinatorial optimization
- sequence dependent setup times
- single machine
- tabu search
- scheduling problem
- release dates
- setup times
- branch and bound algorithm
- search procedure
- processing times
- precedence constraints
- release times
- genetic algorithm
- evolutionary computation
- branch and bound
- traveling salesman problem
- hybrid algorithm
- simulated annealing
- vehicle routing problem
- resource consumption
- metaheuristic
- np hard
- lagrangian relaxation
- partially ordered