Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074069
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:25:59 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Thursday, March 24, 2011 - 2:08:21 PM

Identifiers

  • HAL Id : inria-00074069, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

176

Files downloads

96