ISSN:
1573-2878
Keywords:
Production schedule
;
scheduling problems
;
quasivariational inequalities
;
Bellman equation
;
numerical solutions
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1022682711077
Permalink
