A Fast Computional Procedure to Solve The Multi-Item Single Machine Lot Scheduling Optimization Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

A Fast Computional Procedure to Solve The Multi-Item Single Machine Lot Scheduling Optimization Problem

Abstract

We present in this paper some especial procedures for the numerical solution of the optimal schedule problem of a multi-item single machine. A method of discretization and a computational procedure are described which allows us to calculate the solution in a short time and with a precision of order k, being k the size of the discretization. The principal feature of this method is the fact that the nodes of the triangulation mesh are joined by segments of trajectories of the original system. This feature allows us to obtain the k-order precision which, in general, is impossible to obtain by usual methods. We also develop a highly efficient algorithm that converges in a finite number of steps.
Fichier principal
Vignette du fichier
RR-2616.pdf (1023.99 Ko) Télécharger le fichier

Dates and versions

inria-00074069 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074069 , version 1

Cite

Laura S. Aragone, Roberto L.V. Gonzalez. A Fast Computional Procedure to Solve The Multi-Item Single Machine Lot Scheduling Optimization Problem. [Research Report] RR-2616, INRIA. 1995. ⟨inria-00074069⟩
78 View
24 Download

Share

Gmail Facebook Twitter LinkedIn More