A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration.
Jalil LayeghFariborz JolaiMohsen Sadegh AmalnikPublished in: Adv. Eng. Softw. (2009)
Keyphrases
- single machine
- memetic algorithm
- weighted number of tardy jobs
- scheduling problem
- tabu search
- maximum lateness
- release dates
- release times
- completion times
- processing times
- total weighted tardiness
- earliness tardiness
- job shop scheduling problem
- deteriorating jobs
- sequence dependent setup times
- learning effect
- scheduling jobs
- combinatorial optimization
- evolutionary computation
- benchmark instances
- feasible solution
- dynamic programming
- genetic algorithm
- setup times
- competitive ratio
- parallel machines
- test problems
- flowshop
- vehicle routing problem
- single machine scheduling problem
- neural network
- strongly np hard
- identical machines
- metaheuristic