default search action
Igal Adiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1989
- [j16]Igal Adiri, John L. Bruno, Esther Frostig, A. H. G. Rinnooy Kan:
Single Machine Flow-Time Scheduling With a Single Breakdown. Acta Informatica 26(7): 679-696 (1989) - 1987
- [j15]Igal Adiri, Zvi Yehudai:
Scheduling on machines with variable service rates. Comput. Oper. Res. 14(4): 289-297 (1987) - 1984
- [j14]Igal Adiri, Neta Amit:
Openshop and flowshop scheduling to minimize sum of completion times. Comput. Oper. Res. 11(3): 275-284 (1984) - 1982
- [j13]Igal Adiri, I. Domb:
A Single Server Queueing System Working under Mixed Priority Disciplines. Oper. Res. 30(1): 97-115 (1982) - [j12]N. Hefetz, Igal Adiri:
An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem. Math. Oper. Res. 7(3): 354-360 (1982)
1970 – 1979
- 1979
- [j11]A. Netterman, Igal Adiri:
A Dynamic Priority Queue with General Concave Priority Functions. Oper. Res. 27(6): 1088-1100 (1979) - 1978
- [j10]S. Stashevsky, Igal Adiri:
Design of a Computerized Message-Switching Center. Oper. Res. 26(6): 1020-1032 (1978) - 1976
- [j9]Zvi Rosberg, Igal Adiri:
Multilevel Queues with Extremal Priorities. J. ACM 23(4): 680-690 (1976) - 1974
- [j8]Igal Adiri, Uri Yechiali:
Optimal Priority-Purchasing and Pricing Decisions in Nonmonopoly and Monopoly Queues. Oper. Res. 22(5): 1051-1066 (1974) - 1973
- [j7]Igal Adiri:
Cyclic Queues with Bulk Arrivals. J. ACM 20(3): 416-428 (1973) - [j6]Igal Adiri, Micha Hofri, Micha Yadin:
A Multiprogramming Queue. J. ACM 20(4): 589-603 (1973) - 1971
- [j5]Igal Adiri:
A Dynamic Time-Sharing Priority Queue. J. ACM 18(4): 603-610 (1971) - [j4]Igal Adiri:
A Note on Some Mathematical Models of Time-Sharing Systems. J. ACM 18(4): 611-615 (1971)
1960 – 1969
- 1969
- [j3]Igal Adiri, Benjamin Avi-Itzhak:
A Time-Sharing Model with Many Queues. Oper. Res. 17(6): 1077-1089 (1969) - [j2]Igal Adiri:
Computer Time-Sharing Queues with Priorities. J. ACM 16(1): 631-645 (1969) - [j1]Igal Adiri, Benjamin Avi-Itzhak:
A Time-Sharing Queue with a Finite Number of Customers. J. ACM 16(2): 315-323 (1969)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: