Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing
Due to the complexity of the system, we offer an approximation to the problem. We show that the approximation strategy allows refinement. This progressive refinement of the approximation results in a sequence of approximations that approach the true problem. As the approximation is refined, the computational complexity of the approximated problem grows.
For a simplified system, we show that the approximation has bounded error. Furthermore, we show that the error bound of the approximation sequence improves as the approximation approaches the true problem. This presents a trade-off between computational complexity and accuracy of the solution. A decision maker using this sequence of approximations can quickly determine a level of approximation based on the amount of computational power available and the accuracy needed in a solution.
School:Brigham Young University
School Location:USA - Utah
Source Type:Master's Thesis
Keywords:batch manufacturing makespan minimization sequencing optimization
Date of Publication:03/06/2008