I. Adiri

发表

Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times

D. Pohoryles, I. Adiri, 1982 .

Exponentially distributed jobshop scheduling problems.

E. Frostig, I. Adiri, 1988 .

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

Uri Yechiali, I. Adiri, U. Yechiali, 1971 .

A Dynamic Time-Sharing Priority Queue

Igal Adiri, I. Adiri, 1971, JACM.

Design of a Computerized Message-Switching Center

I. Adiri, S. Stashevsky, I. Adiri, 1978, Oper. Res..

Single machine flow-time scheduling with a single breakdown

Alexander H. G. Rinnooy Kan, John L. Bruno, Esther Frostig, 1989, Acta Informatica.

A Dynamic Priority Queue with General Concave Priority Functions

I. Adiri, A. Netterman, I. Adiri, 1979, Oper. Res..

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

I. Adiri, N. Hefetz, I. Adiri, 1982, Math. Oper. Res..

Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

A.H.G. Rinnooy Kan, I. Adiri, Esther Frostig, 1991 .