Igal Adiri

According to our database, Igal Adiri authored at least 16 papers between 1969 and 1989.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1989

Single Machine Flow-Time Scheduling With a Single Breakdown.

Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan

Acta Informatica, 1989

1987

Scheduling on machines with variable service rates.

Igal Adiri, Zvi Yehudai

Comput. Oper. Res., 1987

1984

Openshop and flowshop scheduling to minimize sum of completion times.

Igal Adiri, Neta Amit

Comput. Oper. Res., 1984

1982

An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem.

N. Hefetz, Igal Adiri

Math. Oper. Res., 1982

A Single Server Queueing System Working under Mixed Priority Disciplines.

Igal Adiri, I. Domb

Oper. Res., 1982

1979

A Dynamic Priority Queue with General Concave Priority Functions.

A. Netterman, Igal Adiri

Oper. Res., 1979

1978

Design of a Computerized Message-Switching Center.

S. Stashevsky, Igal Adiri

Oper. Res., 1978

1976

Multilevel Queues with Extremal Priorities.

Zvi Rosberg, Igal Adiri

J. ACM, 1976

1974

Optimal Priority-Purchasing and Pricing Decisions in Nonmonopoly and Monopoly Queues.

Igal Adiri, Uri Yechiali

Oper. Res., 1974

1973

A Multiprogramming Queue.

Igal Adiri, Micha Hofri, Micha Yadin

J. ACM, 1973

Cyclic Queues with Bulk Arrivals.

Igal Adiri

J. ACM, 1973

1971

A Note on Some Mathematical Models of Time-Sharing Systems.

Igal Adiri

J. ACM, 1971

A Dynamic Time-Sharing Priority Queue.

Igal Adiri

J. ACM, 1971

1969

A Time-Sharing Queue with a Finite Number of Customers.

Igal Adiri, Benjamin Avi-Itzhak

J. ACM, 1969

Computer Time-Sharing Queues with Priorities.

Igal Adiri

J. ACM, 1969

A Time-Sharing Model with Many Queues.

Igal Adiri, Benjamin Avi-Itzhak

Oper. Res., 1969