Approximation of the supply scheduling problem.
Satyaveer Singh ChauhanAnton V. EremeevAnna A. RomanovaVladimir V. ServakhGerhard J. WoegingerPublished in: Oper. Res. Lett. (2005)
Keyphrases
- scheduling problem
- np hard
- single machine
- approximation algorithms
- precedence constraints
- setup times
- minimizing makespan
- processing times
- flowshop
- error bounds
- tabu search
- permutation flowshop
- parallel machines
- approximation ratio
- approximation error
- total tardiness
- earliness tardiness
- neural network
- relative error
- simulated annealing
- maximum lateness
- reinforcement learning
- distribution networks
- data sets
- unrelated parallel machines
- database