A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times.
Davide AnghinolfiMassimo PaolucciPublished in: Eur. J. Oper. Res. (2009)
Keyphrases
- sequence dependent setup times
- discrete particle swarm optimization
- scheduling problem
- single machine
- flowshop
- web service composition
- setup times
- particle swarm optimization
- traveling salesman problem
- total weighted tardiness
- precedence constraints
- vehicle routing problem
- parallel machines
- single machine scheduling problem
- tabu search
- total tardiness
- swarm intelligence
- release dates
- maximum lateness
- np hard
- processing times
- particle swarm optimization algorithm
- solution quality
- service selection
- optimization methods
- service composition
- optimal solution
- web services
- lot sizing
- lower bound
- branch and bound algorithm
- parallel computing
- integer programming
- cost function
- upper bound
- genetic algorithm
- service oriented
- search algorithm
- optimization problems
- mathematical model
- fitness function