Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("WAITING TIME")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3020

  • Page / 121
Export

Selection :

  • and

EINE FAMILIE VON WARTEPROZEDUREN ZWISCHEN FIFO UND LIFO. = UNE FAMILLE DE PROCEDURES D'ATTENTES INTERMEDIAIRE ENTRE FIFO ET LIFOSCHREIBER F.1976; ARCH. ELEKTRON. UEBERTRAG.-TECH.; DTSCH.; DA. 1976; VOL. 30; NO 12; PP. 497-501; ABS. ANGL.; BIBL. 11 REF.Article

FURTHER RESULTS FOR CLOSED CYCLIC QUEUES WITH BALANCED EXPONENTIAL SERVERS.DOBIESKI AW.1978; J. OPERAT. RES. SOC.; GBR; DA. 1978; VOL. 29; NO 6; PP. 607-609; BIBL. 10 REF.Article

A RESULT IN QUEUEING THEORYGHOSAL A.1978; BULL. AUSTRAL. MATH. SOC.; AUS; DA. 1978; VOL. 19; NO 1; PP. 125-129; BIBL. 4 REF.Article

AN APPROXIMATE FORMULA FOR WAITING TIME IN SINGLE SEWER QUEUES.MARCHAL WG.1976; A.I.I.E. TRANS.; U.S.A.; DA. 1976; VOL. 8; NO 4; PP. 473-474; BIBL. 7 REF.Article

AN INVARIANCE PRINCIPLE FOR QUEUES IN HEAVY TRAFFIC.SZCZOTKA W.1976; BULL. ACAD. POLON. SCI., SCI. MATH. ASTR. PHYS.; POLOGNE; DA. 1976; VOL. 24; NO 12; PP. 1119-1125; ABS. RUSSE; BIBL. 14 REF.Article

SOME SIMPLER BOUNDS ON THE MEAN QUEUING TIMEMARCHAL WG.1978; OPER. RES.; USA; DA. 1978; VOL. 26; NO 6; PP. 1083-1088; BIBL. 7 REF.Article

TWO-QUEUES IN TANDEM ATTENDED BY A SINGLE SERVER.TAUBE NETTO M.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 1; PP. 140-147; BIBL. 8 REF.Article

STATIONARY STATE PROBABILITIES AT ARRIVAL INSTANTS FOR CLOSED QUEUEING NETWORKS WITH MULTIPLE TYPES OF CUSTOMERSLAVENBERG SS; REISER M.1980; J. APPL. PROBAB.; ISSN 0021-9002; GBR; DA. 1980; VOL. 17; NO 4; PP. 1048-1061; BIBL. 9 REF.Article

SYSTEME DISCRET AVEC UN SERVICE CYCLIQUE ET UNE PRIORITE RELATIVEBRODETSKAYA TS.1980; KIBERNETIKA; UKR; DA. 1980; NO 6; PP. 100-102; ABS. ENG; BIBL. 2 REF.Article

A TWO-FOLD TANDEM NET WITH DETERMINISTIC LINKS AND SOURCE INTERFERENCEKAPLAN M.1980; OPER. RES.; USA; DA. 1980; VOL. 28; NO 3; PART. 1; PP. 512-526; BIBL. 11 REF.Article

ON TOTAL SOJOURN TIME IN NETWORKS OF QUEUESLEMOINE AJ.1979; MANAG. SCI.; USA; DA. 1979; VOL. 25; NO 10; PP. 1034-1035; BIBL. 3 REF.Article

THE WAITING TIME PROCESS FOR A GENERALIZED CORRELATED QUEUE WITH EXPONENTIAL DEMAND AND SERVICECONOLLY BW; CHOO QH.1979; S.I.A.M. J. APPL. MATH.; USA; DA. 1979; VOL. 37; NO 2; PP. 263-275; BIBL. 7 REF.Article

ESTIMATION DU TEMPS MOYEN D'ATTENTE DANS UN SYSTEME A UNE FILE AVEC REGLAGEKREJNIN A YA.1979; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1979; NO 3; PP. 207-210; BIBL. 12 REF.Article

EXPONENTIAL SPECTRA AS A TOOL FOR THE STUDY OF SERVER-SYSTEMS WITH SEVERAL CLASSES OF CUSTOMERS.KEILSON J.1978; J. APPL. PROBABIL.; G.B.; DA. 1978; VOL. 15; NO 1; PP. 162-170; BIBL. 12 REF.Article

THE QUEUE G/M/M/N: BUSY PERIOD AND CYCLE, WAITING TIME UNDER REVERSE AND RANDOM ORDER SERVICEROSENLUND SI.1978; NAV. RES. LOGIST. QUART.; USA; DA. 1978; VOL. 25; NO 1; PP. 107-119; BIBL. 11 REF.Article

UNE METHODE DE CALCUL POUR SYSTEMES MAILLES AVEC ATTENTEVILLEN ALTAMIRANO M.1978; REV. TELECOMMUNIC.; FRA; DA. 1978; VOL. 53; NO 3; PP. 249-256; BIBL. 12 REF.Article

SYSTEME DE SERVICE SANS PRIORITE D'UN FLOT DE DEMANDES DANS UN SYSTEME MULTICANAL MARKOVIENRYZHIKOV YU I.1977; PROBL. CONTROL INFORM. THEORY; HUNGARY; DA. 1977; VOL. 6; NO 5-6; PP. 431-436; BIBL. 5 REF.; MEME ART. ANGL.Article

ON A SINGLE-SERVER QUEUE WITH GROUP ARRIVALS.COHEN JW.1976; J. APPL. PROBABIL.; G.B.; DA. 1976; VOL. 13; NO 3; PP. 619-622; BIBL. 6 REF.Article

ON THE VIRTUAL AND ACTUAL WAITING TIME DISTRIBUTIONS OF A GI/G/1 QUEUE.HARRISON JM; LEMOINE AJ.1976; J. APPL. PROBABIL.; G.B.; DA. 1976; VOL. 13; NO 4; PP. 833-836; BIBL. 8 REF.Article

QUEUING MODELS FOR MULTIPLE CHAMBER LOCKSGLASSEY CR; ROSS SM.1976; TRANSPORT. SCI.; U.S.A.; DA. 1976; VOL. 10; NO 4; PP. 391-404; BIBL. 6 REF.Article

MULTISERVER COMPUTER-CONTROLLED QUEUING SYSTEM WITH NON PREERUPTIVE PRIORITIES. = SYSTEME DE FILES D'ATTENTE A SERVEURS MULTIPLES ET A PRIORITE SANS PREEMPTION, COMMANDE PAR UN CALCULATEURCHUNG WK.1975; PROC. INSTIT. ELECTR. ENGRS; G.B.; DA. 1975; VOL. 122; NO 11; PP. 1212-1213Article

SOME QUALITATIVE PROPERTIES OF SINGLE SERVER QUEUES.STOYAN D; STOYAN H.1975; MATH. NACHR.; DTSCH.; DA. 1975; VOL. 70; PP. 29-35; BIBL. 9 REF.Article

ATTRITION IN CASE PROCESSING IS RAPE UNIQUE.GALVIN J; POLK K.1983; JOURNAL OF RESEARCH IN CRIME AND DELINQUENCY; ISSN 0022-4278; USA; DA. 1983; VOL. 20; NO 1; PP. 126-154; BIBL. 2 P.Article

QUEUE DISCIPLINES IN HEAVY TRAFFIC = DISCIPLINES DE FILE D'ATTENTE DANS UN TRAFIC DENSEKINGMAN JFC.1982; MATH. OPER. RES.; ISSN 0364-765X; USA; DA. 1982; VOL. 7; NO 2; PP. 262-271; BIBL. 15 REF.Article

RANKING QUEUE SYSTEMS USING STOCHASTIC DOMINANCESHIMSHAK DG.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 3; PP. 248-251; ABS. FRE; BIBL. 6 REF.Article

  • Page / 121