Single machine scheduling to minimize mean absolute lateness: A heuristic solution.
Timothy D. FryRonald D. ArmstrongL. Drew RosenPublished in: Comput. Oper. Res. (1990)
Keyphrases
- heuristic solution
- single machine scheduling
- single machine scheduling problem
- network design
- lower bound
- optimal solution
- network design problem
- knapsack problem
- exhaustive search
- feasible solution
- branch and bound
- branch and bound algorithm
- combinatorial optimization
- upper bound
- traveling salesman problem
- computer networks
- lagrangian relaxation
- computational complexity
- genetic algorithm