A heuristic for single machine scheduling with early and tardy costs.
Renata MazziniVinícius Amaral ArmentanoPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- single machine
- scheduling problem
- deteriorating jobs
- precedence constraints
- total cost
- search algorithm
- optimal solution
- simulated annealing
- satisfy the triangle inequality
- tabu search
- dynamic programming
- completion times
- constraint satisfaction
- solution quality
- processing times
- heuristic methods
- greedy heuristic
- combinatorial optimization
- exact algorithms
- np hard
- heuristic solution
- scheduling jobs