@article {1427, title = {A strong integer programming formulation for hybrid flowshop scheduling}, journal = {Journal of the Operational Research Society}, volume = {71}, year = {2020}, pages = {2042-2052}, doi = {10.1080/01605682.2019.1654414}, url = {https://doi.org/10.1080/01605682.2019.1654414}, author = {Ali Tamer {\"U}nal and Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n} } @article {1487, title = {Periodic Due Date Assignment with Family Setups}, journal = {INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE}, volume = {26}, year = {2019}, pages = {0{\textendash}0}, issn = {-}, author = {Sertdemir, Sevilay and Ali Tamer {\"U}nal and D{\"U}ZG{\.I}T, ZEHRA} } @article {1488, title = {A parallel machine lot-sizing and scheduling problem with a secondary resource and cumulative demand}, journal = {International Journal of Production Research}, volume = {56}, year = {2018}, pages = {3344-3357}, abstract = {

We investigate a parallel machine multi-item lot-sizing and scheduling problem with a secondary resource, in which demands are given for the entire planning horizon rather than for every single period. All-or-nothing assumption of the discrete lot-sizing and scheduling problem is valid so that a machine is either idle or works at full capacity in a period. The objective is to minimise the number of setups and teardowns. We prove that the problem is NP-hard and present two equivalent formulations. We show some properties of the optimal objective value, give optimality conditions and suggest a heuristic algorithm. We discuss and formulate two possible extensions related to real-life applications. Finally, we carry out computational experiments to compare the two formulations, to determine the effect of our proposed modeling improvements on solution performance, and to test the quality of our heuristic.

}, doi = {10.1080/00207543.2017.1406675}, url = {https://doi.org/10.1080/00207543.2017.1406675}, author = {Murat G{\"u}ng{\"o}r and Ali Tamer {\"U}nal and Z C Ta{\c s}k{\i}n} } @article {1090, title = {Employee Scheduling in Service Industries with Flexible Employee Availability and Demand}, journal = {Omega}, volume = {66}, year = {2017}, pages = {159-169}, doi = {http://dx.doi.org/10.1016/j.omega.2016.03.001}, author = {Semra A{\u g}ral{\i} and Z C Ta{\c s}k{\i}n and Ali Tamer {\"U}nal} } @article {1165, title = {Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems}, journal = {International Journal of Production Research}, volume = {55}, year = {2017}, pages = {4164{\textendash}4179}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {786, title = {Mathematical Programming-Based Sales and Operations Planning at Vestel Electronics}, journal = {Interfaces}, volume = {45}, year = {2015}, pages = {325-340}, doi = {http://dx.doi.org/10.1287/inte.2015.0793}, author = {Z C Ta{\c s}k{\i}n and Semra A{\u g}ral{\i} and Ali Tamer {\"U}nal and Vahdet Belada and Filiz G{\"o}kten-Y{\i}lmaz} } @article {albey2014exploratory, title = {An exploratory study of disaggregated clearing functions for production systems with multiple products}, journal = {International Journal of Production Research}, number = {ahead-of-print}, year = {2014}, pages = {1{\textendash}22}, publisher = {Taylor \& Francis}, author = {Albey, Erin{\c c} and {\"U}mit Bilge and Uzsoy, Reha} } @article {becsikci2013resource, title = {Resource dedication problem in a multi-project environment}, journal = {Flexible Services and Manufacturing Journal}, volume = {25}, number = {1-2}, year = {2013}, pages = {206{\textendash}229}, publisher = {Springer}, author = {Be{\c s}ikci, Umut and {\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @article {becsikcci2011different, title = {Different resource management policies in multi-mode resource constrained multi-project scheduling}, year = {2011}, publisher = {Institute of Electrical and Electronics Engineers, Inc.}, author = {Be{\c s}ikci, Umut and {\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @article {TaskinUnal2009, title = {Tactical Level Planning in Float Glass Manufacturing with Co-Production, Random Yields and Substitutable Products}, journal = {European Journal of Operational Research}, volume = {199}, number = {1}, year = {2009}, pages = {252-261}, doi = {http://dx.doi.org/10.1016/j.ejor.2008.11.024}, author = {Z C Ta{\c s}k{\i}n and Ali Tamer {\"U}nal} } @article {14086928, title = {{A clone-based graphical modeler and mathematical model generator for optimal production planning in process industries}}, journal = {European Journal of Operational Research}, volume = {137}, year = {2002}, pages = {483{\textendash}496}, doi = {10.1016/S0377-2217(01)00066-2}, author = {Murat Draman and I. Kuban Altinel and Nijaz Bajgoric and Ali Tamer {\"U}nal and Burak Birg{\"o}ren} } @article {866098, title = {{Some aspects of using CASE tools in a Fusion-based application development project for production optimization}}, journal = {Industrial Management and Data Systems}, volume = {102}, year = {2002}, pages = {463{\textendash}471}, doi = {10.1108/02635570210445899}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @conference {2482925, title = {{Using Paradigm Plus CASE Tool in a Fusion-Based Application Development Project}}, booktitle = {Technology of Object-Oriented Languages and Systems}, year = {1999}, pages = {424{\textendash}427}, doi = {10.1109/TOOLS.1999.796516}, author = {Nijaz Bajgoric and I. Kuban Altinel and Murat Draman and Ali Tamer {\"U}nal} } @article {ulusoy1997genetic, title = {A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles}, journal = {Computers \& Operations Research}, volume = {24}, number = {4}, year = {1997}, pages = {335{\textendash}351}, publisher = {Elsevier}, author = {Ulusoy, G{\"u}nd{\"u}z and Sivrikaya-{\c S}erifoǧlu, Funda and {\"U}mit Bilge} } @article {1489, title = {Rescheduling on a single machine with part type dependent setup times and deadlines}, journal = {Annals of Operations Research}, volume = {70}, year = {1997}, month = {Jan}, pages = {93{\textendash}113}, issn = {02545330}, author = {Ali Tamer {\"U}nal and Uzsoy, Reha and Kiran, Ali} } @article {bilge1995time, title = {A time window approach to simultaneous scheduling of machines and material handling system in an FMS}, journal = {Operations Research}, volume = {43}, number = {6}, year = {1995}, pages = {1058{\textendash}1070}, publisher = {INFORMS}, author = {{\"U}mit Bilge and Ulusoy, G{\"u}nd{\"u}z} } @article {1490, title = {A probabilistic cost-based due date assignment model for job shops}, journal = {International Journal of Production Research}, volume = {31}, year = {1993}, pages = {2817-2834}, abstract = {

Abstract In this paper, a cost-based due date assignment methodology is proposed. The method uses two pre-specified parameters: an estimate of the job flow time and the probability of the job being tardy. An optimization model is presented to find the best tardiness probability of the job based on a total cost function involving the work-in-process inventory and the tardiness costs. Using the results of the correlation analysis performed on a wide set of shop, job and job{\textquoteright}s route related variables, ten models are constructed to estimate the flow time of a job in the shop. The models are then compared based on the simplicity of the model and the standard deviation of the estimate errors. One of the models is recommended and tested to check if it can be used in different shop scenarios. As a result, it is observed that the model performs satisfactorily in all the shop conditions considered in this study.

}, doi = {10.1080/00207549308956902}, url = {https://doi.org/10.1080/00207549308956902}, author = {A. C. KAPLAN and Ali Tamer {\"U}nal} } @article {ulusoy1993simultaneous, title = {Simultaneous scheduling of machines and automated guided vehicles}, journal = {THE INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH}, volume = {31}, number = {12}, year = {1993}, pages = {2857{\textendash}2873}, publisher = {Taylor \& Francis}, author = {Ulusoy, G and {\"U}mit Bilge} } @article {1492, title = {BATCH SEQUENCING}, journal = {IIE Transactions}, volume = {24}, year = {1992}, pages = {73-83}, abstract = {

Consider the single machine scheduling problem where there are a number of part types to be processed. A part type is defined as follows: Two parts are of the same part type if the machine does not require a setup in between the processing of these parts. The problem investigated in this paper is to find a sequence of batches of parts (if there are any) where all the requirements for parts are met. A heuristic and an exact algorithm are developed, and computational analysis is performed to measure the performance of the heuristic. The time complexity function of the heuristic is O(n2), and the exact algorithm runs in polynomial time given a fixed upper bound on the number of setups.

}, doi = {10.1080/07408179208964235}, url = {https://doi.org/10.1080/07408179208964235}, author = {Ali Tamer {\"U}nal and Ali S. Kiran} } @article {1491, title = {A location problem on unicyclic networks: Balanced case}, journal = {European Journal of Operational Research}, volume = {62}, year = {1992}, pages = {194-202}, abstract = {

The problem of locating n stations on a unicyclic unidirectional network is considered. We formulated the problem as an integer program for the case of a balanced flow matrix, i.e., the total inflow to a station equals the total outflow from that station. The integer programming formulation reduces the problem to a station sequencing problem regardless of the actual station locations on the network. Furthermore, the empirical evidence suggests that the LP solutions to the relaxed IP formulations are optimal.

}, issn = {0377-2217}, doi = {https://doi.org/10.1016/0377-2217(92)90247-7}, url = {https://www.sciencedirect.com/science/article/pii/0377221792902477}, author = {Ali S. Kiran and Ali Tamer {\"U}nal and Selcuk Karabati} }