ON FLOW SHOP SCHEDULING WITH RELEASE AND DUE DATES TO MINIMIZE MAXIMUM LATENESSGRABOWSKI J; SKUBALSKA E; SMUTNICKI C et al.1983; JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY; ISSN 0160-5682; GBR; DA. 1983; VOL. 34; NO 7; PP. 615-620; BIBL. 4 REF.Article

APPLYING NEW DOMINANCE CONCEPTS TO JOB SCHEDULE OPTIMIZATION = APPLICATION DE NOUVEAUX CONCEPTS DE DOMINANCE A L'OPTIMISATION DE L'ORDONNANCEMENT DE TACHESERSCHLER J; FONTAN G; MERCE C et al.1982; EUR. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1982; VOL. 11; NO 1; PP. 60-66; BIBL. 7 REF.Article

A BASIS-CONSTRAINED LINEAR PROGRAMMING PROBLEM; ITS FORMULATION AND A BRANCH-AND-BOUND SOLUTION.TABATA K.1977; ELECTR. ENGNG JAP.; U.S.A.; DA. 1977; VOL. 97; NO 1; PP. 132-136; BIBL. 7 REF.Article

ORDONNANCEMENT DE LA PRODUCTION MINIMISANT LES TEMPS DE MONTAGE SUR DES MACHINES ALTERNATIVESHEPPES A; LUGOSI G.1976; ALKALMAZOTT MAT. LAPOK; MAGYAR.; DA. 1976; NO 1-2; PP. 83-91; ABS. ANGL.; BIBL. 2 REF.Article

SUR LA SOLUTION D'UNE CLASSE DE PROBLEMES DE LA THEORIE DE L'ORDONNANCEMENTSOVETOV B YA; TISHKIN AI.1976; IZVEST. VYSSH. UCHEBN. ZAVED., PRIBOROSTR.; S.S.S.R.; DA. 1976; VOL. 19; NO 12; PP. 56-60; BIBL. 3 REF.Article

AN IMPROVED BRANCH AND BOUND PROCEDURE FOR N X M FLOW SHOP PROBLEMS.PANWALKAR SS; KHAN AW.1976; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1976; VOL. 22; NO 4; PP. 787-790; BIBL. 13 REF.Article

METHODE ARBORESCENTE POUR LE CALCUL DES FONCTIONS DE RECURRENCE DONNEES SUR DES GRAPHESSAPAROV MS.1982; IZVESTIJA AKEDEMII NAUK SSSR. TEHNICESKAJA KIBERNETIKA; ISSN 0002-3388; SUN; DA. 1982; NO 6; PP. 191-200; BIBL. 4 REF.Article

A BRANCH AND BOUND NETWORK ALGORITHM FOR INTERACTIVE PROCESS SCHEDULINGBAKER TE.1981; MATH. PROGRAM. STUDY; ISSN 0303-3929; NLD; DA. 1981; VOL. 15; PP. 43-57; BIBL. 10 REF.Article

KOMBINATORYCZNA METODA SELEKCJI CECH W ROZPOZNAWANIU OBRAZOW NA PODSTAWIE WZROSTU RYZYKA = METHODE COMBINATOIRE DE SELECTION EN RECONNAISSANCE DES FORMES BASEE SUR L'AUGMENTATION DU RISQUEWILIMOWSKA Z.1980; ARCH. AUTOM. TELEMECH.; ISSN 0004-072X; POL; DA. 1980; VOL. 25; NO 3; PP. 405-417; ABS. RUS/ENG; BIBL. 18 REF.Article

AN ADAPTIVE BRANCHING RULE FOR THE PERMUTATION FLOW-SHOP PROBLEMPOTTS CN.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 5; NO 1; PP. 19-25; BIBL. 18 REF.Article

FLOW SHOP SCHEDULING WITH PARALLEL MACHINESMITTAL BS; BAGGA PC.1979; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1979; VOL. 21; NO 1; PP. 87-91; BIBL. 1 REF.Article

A PRACTICAL APPROACH TO PRODUCTION SCHEDULINGBESTWICK PF; LOCKYER KG.1979; INTERNATION. J. PRODUCT. RES.; GBR; DA. 1979; VOL. 17; NO 2; PP. 95-109; ABS. FRE/GER; BIBL. 2 P.Article

OPTIMAL RELIABILITY ALLOCATION BY BRANCH-AND-BOUND TECHNIQUE.NAKAGAWA Y; NAKASHIMA K; HATTORI Y et al.1978; I.E.E.E. TRANS. RELIABIL.; USA; DA. 1978; VOL. 27; NO 1; PP. 31-38; BIBL. 24 REF.Article

MINIMIZING THE SUM OF COMPLETION TIMES OF N JOBS OVER M MACHINES IN A FLOWSHOP. A BRANCH AND BOUND APPROACH.BANSAL SP.1977; A.I.I.E. TRANS.; U.S.A.; DA. 1977; VOL. 9; NO 3; PP. 306-311; BIBL. 9 REF.Article

SEQUENCING N JOBS ON M MACHINES TO MINIMISE MAXIMUM TARDINESS: A BRANCH- AND- BOUND SOLUTION.TOWNSEND W.1977; MANAG. SCI.; U.S.A.; DA. 1977; VOL. 23; NO 9; PP. 1016-1019; BIBL. 6 REF.Article

PROBLEMES DE LOCALISATION A PLUSIEURS BIENSVLACH M.1977; EKON.-MAT. OBZ.; CESKOSL.; DA. 1977; VOL. 13; NO 3; PP. 322-330; ABS. ANGL.; BIBL. 4 REF.Article

UEBER EINE KLASSE NICHTKONVEXER OPTIMIERUNGSPROBLEME. = SUR UNE CLASSE DE PROBLEMES DE PROGRAMMATION NON CONVEXEHIRCHE J; HO KHAC TAN.1977; Z. ANGEW. MATH. MECH.; DTSCH.; DA. 1977; VOL. 57; NO 4; PP. 247-253; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

ON MITTEN'S AXIOMS FOR BRANCH-AND-BOUND.RINNOOY KAN AHG.1976; OPER. RES.; U.S.A.; DA. 1976; VOL. 24; NO 6; PP. 1176-1178; BIBL. 3 REF.Article

THEORETICAL COMPARISONS OF SEARCH STRATEGIES IN BRANCH-AND-BOUND ALGORITHMS.IBARAKI T.1976; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 315-344; BIBL. 19 REF.Article

A BRANCH AND BOUND ALGORITHM FOR FEATURE SUBSET SELECTION.NARENDRA PM; FUKUNAGA K.1976; IN: INT. CONF. CYBERN. SOC. PROC.; WASHINGTON, D.C.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 497-503; BIBL. 8 REF.Conference Paper

LARGE SCALE DECISION TREE OPTIMIZATION BY BRANCH AND BOUND METHODSKAN CHEN; JARBOE KP.1980; LARGE SCALE SYSTEMS. THEORY AND APPLICATIONS. SYMPOSIUM ON LARGE SCALE SYSTEMS: THEORY AND APPLICATIONS. 2/1980/TOULOUSE; GBR/USA/FRA; OXFORD: PERGAMON PRESS/NEW YORK: PERGAMON PRESS/PARIS: PERGAMON PRESS; DA. 1980; PP. 339-348; BIBL. 11 REF.Conference Paper

REVERSED GEOMETRIC PROGRAMMING: A BRANCH-AND-BOUND METHOD INVOLVING LINEAR SUBPROBLEMSCOLE F; GOCHET W; VAN ASSCHE F et al.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 5; NO 1; PP. 26-35; BIBL. 15 REF.Article

VARIANTE MULTIPLICATIVE DU PREMIER ALGORITHME DE GOMORY ET SES COMBINAISONS AVEC LA METHODE ARBORESCENTERYNDIN BN.1977; VEST. LENINGRAD. UNIV.; S.S.S.R.; DA. 1977; NO 7; PP. 85-89; ABS. ANGL.; BIBL. 6 REF.Article

A BRANCH- AND -BOUND METHOD FOR SEQUENCING PROBLEMS WITH LINEAR AND EXPONENTIAL PENALTY FUNCTIONS.TOWNSEND W.1977; OPER. RES. QUART.; G.B.; DA. 1977; VOL. 28; NO 1II; PP. 191-200; BIBL. 16 REF.Article

A NEW FORMULATION AND SOLUTION OF THE SEQUENCING PROBLEM: ALGORITHM.GRABOWSKI J.1977; ZASTOSOW. MAT.; POLSKA; DA. 1977; VOL. 15; NO 4; PP. 463-474; ABS. POL.; BIBL. 2 REF.Article