Igal Adiri

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
1989 J jnl
Single Machine Flow-Time Scheduling With a Single Breakdown.
Acta Informatica
Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan
1987 J jnl
Scheduling on machines with variable service rates.
Comput. Oper. Res.
Igal Adiri, Zvi Yehudai
1984 J jnl
Openshop and flowshop scheduling to minimize sum of completion times.
Comput. Oper. Res.
Igal Adiri, Neta Amit
1982 J jnl
A Single Server Queueing System Working under Mixed Priority Disciplines.
Oper. Res.
Igal Adiri, I. Domb
1982 J jnl
An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem.
Math. Oper. Res.
N. Hefetz, Igal Adiri
1979 J jnl
A Dynamic Priority Queue with General Concave Priority Functions.
Oper. Res.
A. Netterman, Igal Adiri
1978 J jnl
Design of a Computerized Message-Switching Center.
Oper. Res.
S. Stashevsky, Igal Adiri
1976 J jnl
Multilevel Queues with Extremal Priorities.
J. ACM
Zvi Rosberg, Igal Adiri
1974 J jnl
Optimal Priority-Purchasing and Pricing Decisions in Nonmonopoly and Monopoly Queues.
Oper. Res.
Igal Adiri, Uri Yechiali
1973 J jnl
A Multiprogramming Queue.
J. ACM
Igal Adiri, Micha Hofri, Micha Yadin
1973 J jnl
Cyclic Queues with Bulk Arrivals.
J. ACM
Igal Adiri
1971 J jnl
A Dynamic Time-Sharing Priority Queue.
J. ACM
Igal Adiri
1971 J jnl
A Note on Some Mathematical Models of Time-Sharing Systems.
J. ACM
Igal Adiri
1969 J jnl
A Time-Sharing Model with Many Queues.
Oper. Res.
Igal Adiri, Benjamin Avi-Itzhak
1969 J jnl
A Time-Sharing Queue with a Finite Number of Customers.
J. ACM
Igal Adiri, Benjamin Avi-Itzhak
1969 J jnl
Computer Time-Sharing Queues with Priorities.
J. ACM
Igal Adiri