Fast Computational Procedure for Solving Multi-Item Single-Machine Lot Scheduling Optimization Problems |
| |
Authors: | L S Aragone R L V Gonzalez |
| |
Institution: | (1) Departamento de Matemática, Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Rosario, Argentina;(2) Deparamento de Matemática, Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Universidad Nacional de Rosario, Rosario, Argentina |
| |
Abstract: | In this paper, we deal with the numerical solution of the optimal scheduling problem in a multi-item single machine. We develop a method of discretization and a computational procedure which allows us to compute the solution in a short time and with a precision of order k, where k is the discretization size. In our method, the nodes of the triangulation mesh are joined by segments of trajectories of the original system. This special feature allows us to obtain precision of order k, which is in general impossible to achieve by usual methods. Also, we develop a highly efficient algorithm which converges in a finite number of steps. |
| |
Keywords: | Production schedule scheduling problems quasivariational inequalities Bellman equation numerical solutions |
本文献已被 SpringerLink 等数据库收录! |
|