SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPANBRUNO J; DOWNEY P; FREDERICKSON GN et al.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 1; PP. 100-113; BIBL. 8 REF.Article

TWO SINGLE MACHINE SEQUENCING PROBLEMS INVOLVING CONTROLLABLE JOB PROCESSING TIMESVICKSON RG.1980; A.I.I.E. TRANS.; USA; DA. 1980; VOL. 12; NO 3; PP. 258-262; BIBL. 13 REF.Article

VERIFICATION OF COMPUTER SYSTEM MODELS BY MEASURED CP4 PROCESSING TIME DISTRIBUTIONHARADA N; HAKOZAKI K.1978; SYST. COMPUTERS CONTROLS; USA; DA. 1978; VOL. 9; NO 1; PP. 69-76; BIBL. 11 REF.Article

UN FIL D'ARIANE. II: MICROPROCESSEURS ET CONCEPTION DES PETITS ORDINATEURSBOUHOT JP; COTTIN G; TRICOT J et al.sdCA.H., C.I.L.O.; FRA; DA. S.D.; NO 6; PP. 3-16Article

IMPLEMENTATION OF A COMPUTER JOB SCHEDULING ALGORITHM: A CASE HISTORYGUJAR UG; FELLOWS DM.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 5; PP. 529-542; BIBL. 12 REF.Article

MODIFICATIONS TO THE FORSYTHE-MOLER ALGORITHM FOR SOLVING LINEAR ALGEBRAIC SYSTEMS.SMITH DA; GUIPRE PS.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 6; PP. 174-177; BIBL. 2 REF.Article

MINIMIZING PROCESSING RESTS IN AN AUTOMATED OFFICE SYSTEMSMITH SA.1980; IEEE TRANS. SYST. MAN CYBERN.; ISSN 0018-9472; USA; DA. 1980; VOL. 10; NO 5; PP. 232-242; BIBL. 12 REF.Article

SPEEDUP IN PARALLEL ALGORITHMS FOR ADAPTIVE QUADRATURELEMME JM; RICE JR.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 1; PP. 65-71; BIBL. 5 REF.Article

A SIMPLE PRIORITY QUEUE IN WHICH INITIALIZATION AND QUEUE OPERATIONS TAKE O (LOGLOG N) TIMEJOHNSON DB.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 66-71; BIBL. 11 REF.Conference Paper

APPLICATION OF PROBABILISTIC TECHNIQUES TO NP-HARD NUMBER PROBLEMSJOHNSON DB; KASHDAN SD.1978; CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS. 12/1978-03-29/BALTIMORE; USA; BALTIMORE: JOHNS HOPKINS UNIVERSITY; DA. 1978; PP. 46-51; BIBL. 17 REF.Conference Paper

POWER AND TIME FACTOR IN ELECTROCAUTERY AND DIATHERMYPAVER K; DOYLE J; KRIVANEK J et al.1982; CUTIS; USA; DA. 1982; VOL. 29; NO 5; PP. 497-498Article

ALTERNATIVE ACCESS ROUTES TO ONLINE COMPUTERSAUBER PR.1982; NATIONAL ONLINE MEETING. 3/1982-03-31/NEW YORK NY; USA; MEDFORD: LEARNED INFORMATION; DA. 1982; PP. 15-22; BIBL. 3 REF.Conference Paper

COMPARISON OF DIFFERENT DISK SEARCHING METHODSQUITTNER P; KOTSIS D.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 6; PP. 673-679; BIBL. 5 REF.Article

MINIMAL RESOURCES FOR FIXED AND VARIABLE JOB SCHEDULES.GERTSBAKH I; STERN HI.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 68-85; BIBL. 11 REF.Article

WITHDRAWAL FROM HEROIN IN THREE OR SIX WEEKS: COMPARISON OF METHADYL ACETATE AND METHADONESORENSEN JL; HARGREAVES WA; WEINBERG JA et al.1982; ARCHIVES OF GENERAL PSYCHIATRY; ISSN 0003-990X; USA; DA. 1982; VOL. 39; NO 2; PP. 167-171; BIBL. 19 REF.Article

IMPROVEMENT OF RELOCATABLE LINKAGE EDITOR (LOADER) INPUTMUCKE FU; TRIER W.1978; SOFTWARE-PRACT. EXPER.; GBR; DA. 1978; VOL. 8; NO 4; PP. 417-419; BIBL. 4 REF.Article

A SOLVABLE CASE OF THE ONE-MACHINE SCHEDULING PROBLEM WITH READY AND DUE TIMES.KISE H; IBARAKI T; MINE H et al.1978; OPER. RES.; U.S.A.; DA. 1978; VOL. 26; NO 1; PP. 121-126; BIBL. 7 REF.Article

Optimal sequencing and arrangement in distributed single-level tree networks with communication delaysBHARADWAJ, V; GHOSE, D; MANI, V et al.IEEE transactions on parallel and distributed systems. 1994, Vol 5, Num 9, pp 968-976, issn 1045-9219Article

The role of additional processing time and lexical constraint in spoken word recognitionLOCASTO, Paul C; CONNINE, Cynthia M; PATTERSON, David et al.Language and speech. 2007, Vol 50, Num 1, pp 53-75, issn 0023-8309, 23 p.Article

Novel Fine-tuned Model-based SRAF Generation Method Using Coherence MapKODERA, Katsuyoshi; TANAKA, Satoshi; YAMAJI, Mikiyasu et al.Proceedings of SPIE, the International Society for Optical Engineering. 2010, Vol 7640, issn 0277-786X, isbn 978-0-8194-8054-5 0-8194-8054-1, 764017.1-764017.9, 2Conference Paper

A fast Voronoi-diagram algorithm with quaternary tree bucketingOHYA, T; IRI, M; MUROTA, K et al.Information processing letters. 1984, Vol 18, Num 4, pp 227-231, issn 0020-0190Article

On the average running time of odd-even merge sortRUB, C.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 329-346, issn 0196-6774Article

Local search in coding theoryAARTS, E. H. L; VAN LAARHOVEN, P. J. M.Discrete mathematics. 1992, Vol 106-7, pp 11-18, issn 0012-365XArticle

The effect of machine availability on the worst-case performance of LPTHWANG, Hark-Chin; LEE, Kangbok; CHANG, Soo Y et al.Discrete applied mathematics. 2005, Vol 148, Num 1, pp 49-61, issn 0166-218X, 13 p.Article

Prediction and reduction of process times for the PC-based computer numerically controlled drilling machineONWUBOLU, G. C; KUMAR, S.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2004, Vol 218, Num 1, pp 135-141, issn 0954-4054, 7 p.Article