An exact algorithm and a heuristic for scheduling linearly deteriorating jobs with arbitrary precedence constraints and maximum cost criterion.
Marek DebczynskiStanislaw GawiejnowiczPublished in: FedCSIS (2012)
Keyphrases
- precedence constraints
- deteriorating jobs
- maximum lateness
- branch and bound algorithm
- scheduling problem
- single machine scheduling problem
- single machine
- optimal solution
- release dates
- combinatorial optimization
- precedence relations
- parallel machines
- tabu search
- setup times
- sequence dependent setup times
- release times
- scheduling jobs
- branch and bound
- lagrangian relaxation
- np hard
- total cost
- lower bound
- approximation algorithms
- job shop scheduling problem
- strongly np hard
- search algorithm
- flowshop
- processing times
- partial order
- dynamic programming
- partially ordered
- heuristic methods
- global constraints
- integer programming
- simulated annealing
- lower and upper bounds
- solution quality
- metaheuristic
- minimizing makespan
- special case