Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times.
Viswanathan KodaganallurAnup K. SenSubrata MitraPublished in: Comput. Ind. Eng. (2014)
Keyphrases
- single machine scheduling problem
- sequence dependent setup times
- completion times
- release dates
- single machine
- branch and bound algorithm
- genetic algorithm
- processing times
- setup times
- precedence constraints
- hybrid algorithm
- combinatorial optimization
- scheduling problem
- objective function
- resource consumption
- lagrangian relaxation
- search procedure
- flowshop
- neural network
- fitness function
- optimization algorithm
- upper bound
- message passing
- metaheuristic
- np hard
- optimal solution
- simulated annealing
- markov random field