@article{kacar_irdem_uzsoy_2012, title={An Experimental Comparison of Production Planning Using Clearing Functions and Iterative Linear Programming-Simulation Algorithms}, volume={25}, ISSN={["0894-6507"]}, DOI={10.1109/tsm.2011.2176560}, abstractNote={We compare the performance of three algorithms for production planning with workload-dependent lead times. These include a clearing function model using two different methods for estimating the clearing functions, and two iterative algorithms that combine linear programming and simulation models. Our experimental comparison uses a simulation model of a re-entrant bottleneck system built with attributes of a real-world semiconductor fabrication environment. We vary the bottleneck utilization, demand patterns, the mean time to failure, and the mean time to repair. Results indicate that the clearing function model performs better than the iterative algorithms on the scaled-down system considered, giving less variable production plans and higher profit values.}, number={1}, journal={IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING}, author={Kacar, Necip Baris and Irdem, Durmus Fatih and Uzsoy, Reha}, year={2012}, month={Jan}, pages={104–117} }
 @article{irdem_kacar_uzsoy_2010, title={An Exploratory Analysis of Two Iterative Linear Programming-Simulation Approaches for Production Planning}, volume={23}, ISSN={["1558-2345"]}, DOI={10.1109/tsm.2010.2051751}, abstractNote={Production planning models that aim at determining optimal release schedules for production facilities face a fundamental circularity. In order to match supply to demand in an optimal manner, they must recognize the cycle time that elapses between material being released into the plant and its emergence as finished product. However, it is well known from queuing models that the mean cycle time increases nonlinearly with resource utilization, which is determined by the release schedule. To address this circularity, a number of authors have suggested algorithms which iterate between a linear programming model that determines releases for a set of flow time estimates, and a simulation model that evaluates the production realized from that release schedule. We present computational experiments examining the behavior of two such algorithms. We find that the convergence behavior of one is significantly more consistent than that of the other, and explore insights that may lead to improved algorithms.}, number={3}, journal={IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING}, author={Irdem, D. Fatih and Kacar, N. Baris and Uzsoy, Reha}, year={2010}, month={Aug}, pages={442–455} }
 @inproceedings{irdem_kacar_uzsoy_2008, title={An Experimental study of an iterative simulation-optimization algorithm for production planning}, booktitle={2008 Winter Simulation Conference, vols 1-5}, author={Irdem, D. F. and Kacar, N. B. and Uzsoy, R.}, year={2008}, pages={2176–2184} }