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.
Type de document :
Rapport
[Research Report] RR-2616, INRIA. 1995
Liste complète des métadonnées

https://hal.inria.fr/inria-00074069
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:25:59
Dernière modification le : mardi 17 avril 2018 - 11:28:25
Document(s) archivé(s) le : jeudi 24 mars 2011 - 14:08:21

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

155

Téléchargements de fichiers

78