@article {1473, title = {Profitable Decarbonization through E-Mobility}, journal = {Energies}, volume = {13}, year = {2020}, abstract = {

This paper focuses on the interdependent relationship of power generation, transportation and CO2 emissions to evaluate the impact of electric vehicle deployment on power generation and CO2 emissions. The value of this evaluation is in the employment of a large-scale, bottom-up, national energy modeling system that encompasses the complex relationships of producing, transforming, transmitting and supplying energy to meet the useful demand characteristics with great technological detail. One of such models employed in this analysis is the BUEMS model. The BUEMS model provides evidence of win-win policy options that lead to profitable decarbonization using Turkey{\textquoteright}s data in BUEMS. Specifically, the result shows that a ban on diesel fueled vehicles reduces lifetime emissions as well as lifetime costs. Furthermore, model results highlight the cost-effective emission reduction potential of e-buses in urban transportation. More insights from the results indicate that the marginal cost of emission reduction through e-bus transportation is much lower than that through other policy measures such as carbon taxation in transport. This paper highlights the crucial role the electricity sector plays in the sustainability of e-mobility and the value of related policy prescriptions.

}, issn = {1996-1073}, doi = {10.3390/en13164042}, url = {https://www.mdpi.com/1996-1073/13/16/4042}, author = {G{\"u}rkan Kumbaro{\u g}lu and Canaz, Cansu and Deason, Jonathan and Shittu, Ekundayo} } @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 {1452, title = {Performance analysis of an aggregation and disaggregation solution procedure to obtain a maintenance plan for a partially observable multi-component system}, journal = {Reliability Engineering \& System Safety}, volume = {167}, year = {2017}, pages = {652-662}, abstract = {

We analyze the performance of an aggregation and disaggregation procedure in giving the optimal maintenance decisions for a multi-component system under partial observations in a finite horizon. The components deteriorate in time and their states are hidden to the decision maker. Nevertheless, it is possible to observe signals about the system status and to replace components in each period. The aim is to find a cost effective replacement plan for the components in a given time horizon. The problem is formulated as a partially observable Markov decision process (POMDP). We aggregate states and actions in order to reduce the problem space and obtain an optimal aggregate policy which we disaggregate by simulating it using dynamic Bayesian networks (DBN). The procedure is statistically compared to an approximate POMDP solver that uses the full state space information. Cases where aggregation performs relatively better are isolated and it is shown that k-out-of-n systems belong to this class.

}, keywords = {Aggregation, Disaggregation, Dynamic Bayesian networks, Maintenance, Multi-component systems, Partially observable Markov decision processes}, issn = {0951-8320}, doi = {https://doi.org/10.1016/j.ress.2017.04.013}, url = {https://www.sciencedirect.com/science/article/pii/S095183201730443X}, author = {Demet {\"O}zg{\"u}r-{\"U}nl{\"u}ak{\i}n and Taner Bilgi{\c c}} } @article {1506, title = {A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs}, journal = {Information Processing Letters}, volume = {121}, year = {2017}, pages = {29-33}, abstract = {

It is known that the maximum cardinality cut problem is NP-hard even in chordal graphs. On the positive side, the problem is known to be polynomial time solvable in some subclasses of proper interval graphs which is in turn a subclass of chordal graphs. In this paper, we consider the time complexity of the problem in proper interval graphs, and propose a polynomial-time dynamic programming algorithm.

}, keywords = {Graph algorithms, Maximum cut, Proper interval graph}, issn = {0020-0190}, doi = {https://doi.org/10.1016/j.ipl.2017.01.007}, url = {https://www.sciencedirect.com/science/article/pii/S0020019017300133}, author = {Arman Boyac{\i} and Ekim, Tinaz and Mordechai Shalom} } @article {1177, title = {Prediction equations for permanent impairment of the upper extremity due to the loss of range of motion}, journal = {Work}, volume = {53}, year = {2016}, pages = {409{\textendash}420}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {1169, title = {PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem}, journal = {Journal of Heuristics}, volume = {22}, year = {2016}, pages = {147{\textendash}179}, author = {G{\"o}kalp Erbeyo{\u g}lu and {\"U}mit Bilge} } @article {ekcsiouglu2015prediction, title = {Prediction equations for permanent impairment of the upper extremity due to the loss of range of motion}, journal = {Journal of WORK}, number = {Preprint}, year = {2015}, pages = {1{\textendash}12}, publisher = {IOS Press}, author = {Mahmut Ek{\c s}io{\u g}lu} } @article {ekim2014polar, title = {Polar cographs}, journal = {Discrete Applied Mathematics}, volume = {171}, number = {EPFL-ARTICLE-199582}, year = {2014}, pages = {158{\textendash}158}, publisher = {Elsevier Science Bv}, author = {Ekim, Tinaz and Mahadev, NVR and de Werra, Dominique} } @article {bonomo2013perfectness, title = {Perfectness of clustered graphs}, journal = {Discrete Optimization}, volume = {10}, number = {4}, year = {2013}, pages = {296{\textendash}303}, publisher = {Elsevier}, author = {Bonomo, Flavia and Cornaz, Denis and Ekim, Tinaz and Ries, Bernard} } @article {ekim2013polar, title = {Polar permutation graphs are polynomial-time recognisable}, journal = {European Journal of Combinatorics}, volume = {34}, number = {3}, year = {2013}, pages = {576{\textendash}592}, publisher = {Academic Press}, author = {Ekim, Tinaz and Heggernes, Pinar and Meister, Daniel} } @conference {mutallip2012parametric, title = {A Parametric Analysis of the Effect of a Material Supply Line Delay in Stock Management}, booktitle = {The 30th International System Dynamics Conference, St. Gallen, Switzerland}, year = {2012}, publisher = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, organization = {System Dynamics Society (http://www.systemdynamics.org/conferences/2012/index.html)}, author = {Mutallip, Ahmet and Yasarcan, Hakan} } @article {ekim2009partitioning, title = {Partitioning graphs into complete and empty graphs}, journal = {Discrete Mathematics}, volume = {309}, number = {19}, year = {2009}, pages = {5849{\textendash}5856}, publisher = {Elsevier}, author = {Ekim, Tinaz and Gimbel, John} } @article {1471, title = {Performance analysis of a hybrid system under quality impact of returns}, journal = {Computers \& Industrial Engineering}, volume = {56}, year = {2009}, month = {Mar}, pages = {507{\textendash}520}, issn = {03608352}, author = {Behret, H{\"u}lya and Aybek Korugan} } @article {bilge2008parametric, title = {A parametric fuzzy logic approach to dynamic part routing under full routing flexibility}, journal = {Computers \& Industrial Engineering}, volume = {55}, number = {1}, year = {2008}, pages = {15{\textendash}33}, publisher = {Elsevier}, author = {{\"U}mit Bilge and F{\i}rat, Murat and Albey, Erin{\c c}} } @article {ekim2008polar, title = {Polar cographs}, journal = {Discrete Applied Mathematics}, volume = {156}, number = {10}, year = {2008}, pages = {1652{\textendash}1660}, publisher = {North-Holland}, author = {Ekim, Tinaz and Mahadev, Nadimpalli VR and de Werra, Dominique} } @article {ekim2008polarity, title = {Polarity of chordal graphs}, journal = {Discrete Applied Mathematics}, volume = {156}, number = {13}, year = {2008}, pages = {2469{\textendash}2479}, publisher = {Elsevier}, author = {Ekim, Tinaz and Hell, Pavol and Stacho, Juraj and de Werra, Dominique} } @article {demange2005p, title = {(p, k)-coloring problems in line graphs}, journal = {Theoretical computer science}, volume = {349}, number = {3}, year = {2005}, pages = {462{\textendash}474}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {demange2005partitioning, title = {Partitioning cographs into cliques and stable sets}, journal = {Discrete Optimization}, volume = {2}, number = {2}, year = {2005}, pages = {145{\textendash}153}, publisher = {Elsevier}, author = {Demange, Marc and Ekim, Tinaz and de Werra, Dominique} } @article {56229753, title = {{Product-line selection and pricing with remanufacturing under availability constraints}}, volume = {5583}, year = {2004}, pages = {244{\textendash}255}, doi = {10.1117/12.572218}, author = {Necati Aras and G{\"o}k{\c c}e Esenduran and I. Kuban Altinel} } @article {eksioglu1997predicting, title = {Predicting peak pinch strength: Artificial neural networks vs. regression}, journal = {Occupational Health and Industrial Medicine}, volume = {1}, number = {36}, year = {1997}, pages = {5}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, JE and Twomey, JM} } @article {14443126, title = {{Parametric distance functions vs. nonparametric neural networks for estimating road travel distances}}, journal = {European Journal of Operational Research}, volume = {93}, year = {1996}, pages = {230{\textendash}243}, doi = {10.1016/0377-2217(96)00045-8}, author = {Ethem Alpaydin and I. Kuban Altinel and Necati Aras} } @article {eksioglu1996predicting, title = {Predicting peak pinch strength: artificial neural networks vs. regression}, journal = {International Journal of Industrial Ergonomics}, volume = {18}, number = {5}, year = {1996}, pages = {431{\textendash}441}, publisher = {Elsevier}, author = {Mahmut Ek{\c s}io{\u g}lu and Fernandez, Jeffrey E and Twomey, Janet M} } @article {Hoermann;Derflinger:1993a, title = {A Portable Random Number Generator Well Suited for the Rejection Method}, volume = {19}, number = {4}, year = {1993}, pages = {489{\textendash}495}, abstract = {

Up to now, all known efficient portable implementations of linear congruential random number generators with modulus $2^{31} - 1$ have worked only with multipliers that are small compared with the modulus. We show that for nonuniform distributions, the rejection method may generate random numbers of bad qualify if combined with a linear congruential generator with small multiplier. A method is described that works for any multiplier smaller than $2^{30}$. It uses the decomposition of multiplier and seed in high-order and low-order bits to compute the upper and lower half of the product. The sum of the two halves gives the product of multiplier and seed modulo $2^{21} - 1$. Coded in ANSI-C and FORTRAN77 the method results in a portable implementation of the linear congruential generator that is as fast or faster than other portable methods.

}, keywords = {algorithms, linear congruential generator, portability, quality of nonuniform random numbers, rejection method, uniform random number generator}, author = {Wolfgang H{\"o}rmann and Derflinger, Gerhard} } @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} }