default search action
Adar A. Kalir
Person information
- affiliation: Intel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c15]Denny Kopp, Michael Hassoun, Adar Kalir, Lars Mönch:
Integrating Critical Queue Time Constraints Into SMT2020 Simulation Models. WSC 2020: 1813-1824
2010 – 2019
- 2019
- [j5]Jinho Shin, Dean Grosbard, James R. Morrison, Adar Kalir:
Decomposition without aggregation for performance approximation in queueing network models of semiconductor manufacturing. Int. J. Prod. Res. 57(22): 7032-7045 (2019) - [c14]Michael Hassoun, Denny Kopp, Lars Mönch, Adar Kalir:
A New High-Volume/Low-Mix Simulation Testbed for Semiconductor Manufacturing. WSC 2019: 2419-2428 - 2018
- [c13]Adar A. Kalir, Kosta Rozen:
Optimizing Starts for Capacity, velocity, and output during the ramp-up period of a semiconductor fab. WSC 2018: 3494-3501 - 2017
- [c12]Minho Lee, James R. Morrison, Adar A. Kalir, Kosta Rozen:
On the accuracy of analytic approximations for the mean cycle time in semiconductor manufacturing equipment with PM events. CASE 2017: 737-738 - [c11]Michael Hassoun, Adar Kalir:
Towards a new simulation testbed for semiconductor manufacturing. WSC 2017: 3612-3623 - 2016
- [c10]Jinho Shin, James R. Morrison, Dean Grosbard, Adar Kalir:
Mean cycle time approximations for G/G/m queueing networks using decomposition without aggregation with application to fab datasets. WSC 2016: 2685-2696 - [c9]Adar A. Kalir, Israel Tirkel:
Scheduling preventive maintenance within a queue time for maximum throughput in semiconductor manufacturing. WSC 2016: 2750-2761 - 2015
- [c8]Minho Lee, James R. Morrison, Adar A. Kalir:
Simulation studies on model selection in PM planning optimization. WSC 2015: 2929-2940 - 2014
- [c7]James R. Morrison, Hungil Kim, Adar A. Kalir:
Mean cycle time optimization in semiconductor tool sets via PM planning with different cycles: a G/G/m queueing and nonlinear programming approach. WSC 2014: 2466-2477 - [c6]Adar Kalir, Dean Grosbard:
On the use of simulation in support of capital utilization. WSC 2014: 2617-2627 - 2013
- [j4]Adar Kalir, Yonatan Zorea, Adir Pridor, Lev M. Bregman:
On the complexity of short-term production planning and the near-optimality of a sequential assignment problem heuristic approach. Comput. Ind. Eng. 65(4): 537-543 (2013) - [c5]Dean Grosbard, Adar Kalir, Israel Tirkel, Gad Rabinowitz:
A queuing network model for wafer fabrication using decomposition without aggregation. CASE 2013: 717-722 - [c4]Adar Kalir:
Optimal allocation of testers to products with a queue time restriction in sort testing. ICRA 2013: 3567-3572 - 2012
- [c3]Adar Kalir:
Segregating preventive maintenance work for factory performance improvement. CASE 2012: 646-649
2000 – 2009
- 2007
- [c2]Kfir Berger, Hillel Bar-Gera, Adar Kalir, Gad Rabinowitz:
Analytical Model for Optimal Inspection Frequency with Consideration of Setup Inspections. CASE 2007: 1081-1086 - 2006
- [j3]David Daniely, Adar Kalir, Peter Lopez, Adam Terry:
Effective utilization (Ue). IEEE Robotics Autom. Mag. 13(4): 33-38 (2006) - [c1]Moti Klein, Adar Kalir:
A full factory transient simulation model for the analysis of expected performance in a transition period. WSC 2006: 1836-1839 - 2003
- [j2]Adar A. Kalir, Subhash C. Sarin:
Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups. J. Comb. Optim. 7(1): 23-44 (2003) - 2001
- [j1]Adar A. Kalir, Subhash C. Sarin:
Optimal Solutions for the Single Batch, Flow Shop, Lot-streaming Problem with Equal Sublots. Decis. Sci. 32(2): 387-398 (2001)
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-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint