Irfan M. Ovacik
Irfan M. Ovacik has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
Reha Uzsoy
Purdue University
3 shared publicationsR. Uzsoy
Purdue University
2 shared publicationsEvan Rash
Decision Engineering, Data Platforms Group, Intel Corporation, Chandler, Arizona 85226
1 shared publicationHarry Travis
Decision Engineering, Data Platforms Group, Intel Corporation, Chandler, Arizona 85226
1 shared publicationJ. Hinchman
1 shared publicationJohn Heiney
Supply Chain Decision Solutions, Global Supply Chain, Intel Corporation, Chandler, Arizona 85226
1 shared publication
Latest Publications
- 1 February 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 51 (1) , 9-25
Intel Realizes $25 Billion by Applying Advanced Analytics from Product Architecture Design Through Supply Chain Planning
Due to its scale, the complexity of its products and manufacturing processes, and the capital-intensive nature of the semiconductor business, efficient product architecture design integrated with s...
- 1 February 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Applied Analytics
- Vol. 51 (1) , 9-25
Intel Realizes $25 Billion by Applying Advanced Analytics from Product Architecture Design Through Supply Chain Planning
Due to its scale, the complexity of its products and manufacturing processes, and the capital-intensive nature of the semiconductor business, efficient product architecture design integrated with s...
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2645-2651
A data model for planning in the semiconductor supply chain
A recent gathering of academic and industry researchers has identified the need for a reference model for planning and control in semiconductor supply chains. The purpose of this model is to provide a common language for researchers working on different aspects of modeling and analysis of the semiconductor manufacturing supply chain, facilitate better communication and provide a common starting point for performance assessment across different analysis approaches to the planning and control problems. This paper introduces a data model to advance the discussion of this reference model. The data model is generic in that it is not specific to semiconductor manufacturing, but has been used in practical settings to drive analysis and application development to serve several planning functions in a major semiconductor manufacturing company.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2645-2651
A data model for planning in the semiconductor supply chain
A recent gathering of academic and industry researchers has identified the need for a reference model for planning and control in semiconductor supply chains. The purpose of this model is to provide a common language for researchers working on different aspects of modeling and analysis of the semiconductor manufacturing supply chain, facilitate better communication and provide a common starting point for performance assessment across different analysis approaches to the planning and control problems. This paper introduces a data model to advance the discussion of this reference model. The data model is generic in that it is not specific to semiconductor manufacturing, but has been used in practical settings to drive analysis and application development to serve several planning functions in a major semiconductor manufacturing company.
- 5 October 2010
- Published by Springer Nature
- p. 33-43
Advanced Planning and Scheduling Systems: The Quest to Leverage ERP for Better Planning
- 5 October 2010
- Published by Springer Nature
- p. 33-43
Advanced Planning and Scheduling Systems: The Quest to Leverage ERP for Better Planning
- 24 August 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 272-276
Dispatching Rules For Semiconductor Testing Operations: A Computational Study
- 24 August 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 272-276
Dispatching Rules For Semiconductor Testing Operations: A Computational Study
- 19 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-50
A framework for supply chain management in semiconductor manufacturing industry
- 19 November 2002
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 47-50
A framework for supply chain management in semiconductor manufacturing industry
- 1 September 2000
- Published by Springer Nature in Journal of Heuristics
- Vol. 6 (4) , 481-500
Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems
- 1 September 2000
- Published by Springer Nature in Journal of Heuristics
- Vol. 6 (4) , 481-500
Integrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems
- 1 October 1996
- Published by Springer Nature in International Journal of Flexible Manufacturing Systems
- Vol. 8 (4) , 357-387
Decomposition methods for scheduling semiconductor testing facilities
- 1 October 1996
- Published by Springer Nature in International Journal of Flexible Manufacturing Systems
- Vol. 8 (4) , 357-387
Decomposition methods for scheduling semiconductor testing facilities
- 1 November 1995
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (11) , 3173-3192
Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
We present a family of rolling horizon heuristics for minimizing maximum lateness on parallel identical machines in the presence of sequence dependent setup times and dynamic job arrivals. This problem arises as a subproblem in a decomposition procedure for more complex job shop scheduling problems. The procedures solve a series of single machine subproblems to optimality and implement only part of the solution. Extensive computational experiments show that these methods significantly outperform dispatching rules combined with local search methods, both on average and in the worst case. Their performance advantage is particularly pronounced when there is high competition for machine capacity.
- 1 November 1995
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 33 (11) , 3173-3192
Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
We present a family of rolling horizon heuristics for minimizing maximum lateness on parallel identical machines in the presence of sequence dependent setup times and dynamic job arrivals. This problem arises as a subproblem in a decomposition procedure for more complex job shop scheduling problems. The procedures solve a series of single machine subproblems to optimality and implement only part of the solution. Extensive computational experiments show that these methods significantly outperform dispatching rules combined with local search methods, both on average and in the worst case. Their performance advantage is particularly pronounced when there is high competition for machine capacity.
- 1 January 1994
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 13 (2) , 73-84
Exploiting shop floor status information to schedule complex job shops
- 1 January 1994
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 13 (2) , 73-84
Exploiting shop floor status information to schedule complex job shops
- 1 December 1993
- Published by Elsevier in Operations Research Letters
- Vol. 14 (5) , 251-256
Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
- 1 December 1993
- Published by Elsevier in Operations Research Letters
- Vol. 14 (5) , 251-256
Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times