A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies.
Z. A. M. S. JumanM. A. HoquePublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- total cost
- heuristic solution
- optimal solution
- lower bound
- planning horizon
- holding cost
- multi commodity
- knapsack problem
- upper bound
- production cost
- production planning
- inventory replenishment
- feasible solution
- branch and bound
- network design
- network design problem
- objective function
- branch and bound algorithm
- np hard
- service level
- lower and upper bounds
- exhaustive search
- inventory level
- solution space
- linear program
- lot size
- metaheuristic
- linear programming
- worst case
- search space
- minimum total cost
- genetic algorithm
- setup cost
- customer demand