This is a preview of subscription content, log in via an institution to check access.
Bibloografia
R. W. CONWAY—W. L. MAXWELL—L. W. MILLERTheory of Scheduling Addison-Wesley (1962) (contiene más de 200 referencias bibliográficas ligadas directa o indirectamente al tema,
R. E. BELLMAN—S. E. DREYFUSApplied Dynamic Programming Pincenton University Press (1962)
A. RAMBOZL’ordonnancement Editions de l’Entreprise Moderne (1963)
M. CROLAISGestión Integrée de la Production et Ordennancement Dunod (1967)
S. M. JOHNSONOptimal two and three-stage production schedules with set-up times included. Industrial Sheduling (1964) Naval Research logs; Q. Marzo (1954)
Z. A. LOMNICKIA “branch and bound” algorithm for the exact solution of the three-machine scheduling problem. Operational Research Quart. vol. 16 N. 1 (1965)
A. E. STORY—H. M. WAGNERComputational experience with integer programming for job-shop scheduling. Industrial Sheduling Prentice Hall (1964)
R. COMPANYSMétodos hemísticos en la resolución del problema del “Taller Mecánico” Estudios Empresariales N. 2 (1966)
J. OLIVEEstudio del problema de programación en la industria. Coloquio Hispano-Francés sobre métodos modernos de gestión (1964)
B. ROYPhysonomie et traitement des problemes d’ordonnancement Gestion (Avril 1963)
B. GIFFLER—G. THOMPSONAlgorithms for solving production scheduling problems Journal ORSA—Vol. 8. no. 4 (1960)
A. P. G. BROWN—2 A. LOMNIKTSome Applications of the Brand and Bormd’Algorithem of the Machine Scheduling Problem. Operational Res Quart. no, 17 (1966)
W. L. EASTMAN—SEVEN—I. M. ISAACSLimites para la asignación optima de n tareas a m máquinas Cuadernos de Estadística Aplicada e I. O. Vol. IV—FASC. 3 (1965)
S. H. JOHNSONDiscussion: Secuencing n jobs or two machines with arbitrary times lags Management sciences, vol 5 no 3 (1960)
L. G. MITTENSequencing n jobs or two machines with arbitrary time lags. Management sciences, vol.5 no 3 (1960)
R. D. MITTENSequencing n jobs or two machines with arbitrary time lags. Management sciences, vol. 5 no 3 (1960)
R. D. SMITH—R. A. DUDEKA general algorithm for solution of the n-jobs, M-Machine sequencing problem of the flow-shop Journal ORSA—Vol. 15 no 1 (1967)
R. A. DUDEK—O. F. TEUTON Jr.Development of M-stage décision rule for scheduling n jobs through M machines. Journal ORSA—Vol. 12 no 3 (1964)
G. B. Mc. MAHON—P. G. BURTONFlow-shop scheduling with the Branch and Bound method. Journal ORSA—Vol 15 no 3 (1967)
E. IGNALL—L. SCHRAGEApplication of the Branch and Bound Thechnique to Some. Flow-shop Scheduling Problems Operational Res. Quart. no 16 (1965)
D. S. PALMERSequencing jobs Though a Multi-Stage Process in the Minimum Total Time. — a Quisk Method of Obtaining a Near Optimum Operational Res. Quart. no 16 (1965)
P. NGHIEMLes problémes d’ordonnancement Dunod (1964) Es un conjunto de trabajos monográficos y el presentado por el autor lleva el título.Les problémes dordonnancement avec contraintes disjonctives.
R. COMPANYSIntroducción a los métodos de exploración dirigida. Cuadernos de Estadistica Aplicada e. I. O. Vol. V — F (3) (1968)
A. S. MANNEOn the jobs-shop scheduling problem Journal ORSA — Vol. 8 no 2 (1960)
R. L. SISSONMethods of sequencing in job-shop problems, a review. Journal ORSA — Vol. 7 no 1 (1959)
J. R. JACKSONAu extension of Johnson’s results ou job lot scheduling. Nav. Res. Log. Quart. no 3 (1956)
J. HELLERSome numerical experiments for an M x J flow shop and Tis theoretical aspects. Journal ORSA — Vol. 8 no 1 (1960)
J. HELLER — G. LOGEMANAu algorithm for the construction and evaluation of feasible schedules. Management Science — Vol. 8 no 2 (1962)
B. GIFFLERScheduling general production systems using schedule algebra. Nav. Res. Log. Quart. no 10 (1963)
R. J. GIGLIO — H. M. WAGNERAproximate solutions to the three-machine scheduling problem. Journal ORSA — Vol. 12 no 2 (1964)
H. M. WAGNERAu integer Programming Model for Machine Scheduling. Nav. Res. Log. Quart. no 6 (1959)
H. M. WAGNER — R. J. GIGLIO — R. G. GLSERPreventive Maitenance Scheduling by Mathematical Programming. Management Science no 10 (1964)
B. ROYPrise en compte des contraintes disjontives dans les méthodes de chemin critique. Rev. Franc. de Rech. Opérat. no 38 (1966)
R. COMPANYS colaboradores.Programación y control de proyectos. Cap. IX no especial 27 de Acero y Energía (1966)
B. ROY — P. BERTIERUne procédence de résolution pour une classe de problémes pouvant avoir un caractére combinatoire. Bulletin du Centre international de Calcul de Rome; abril (1965)
I. NABESHIMAThe order of n items procesed ou machines. J. Oper. Res. Soc. Japan — Vol. 3 (1961)
B. GIFFLERMathematical Solution of Production Planning and Scheduling Problems IBM, Technical Report, Advanced Systems Development Division (1960).
R. BELLMANMathematical aspects of scheduling theory. J. Soc. Indust. Appl. Math. Vol. 4 (1956)
E. H. BOWMANProduction scheduling by the transportation method for lineal programing. Journal ORSA — Vol. 34 — no 4 (1956)
S. M. JOHSONSequential production planning over time at minimum cost. Management Science, Vol. 3 (1957)
H. H. GREENBERGA branch-bormd solution to the general Scheduling Problem. Journal ORSA — vol. 16 — no 2 (1968)
Rights and permissions
About this article
Cite this article
Riera, E.T. Una metodologia para solucionar problemas de ordenamiento con ligaduras disyuntivas. Trab. Estad. Invest. Oper. 20, 17–73 (1969). https://doi.org/10.1007/BF03028523
Issue Date:
DOI: https://doi.org/10.1007/BF03028523