Endüstri Mühendisliği Bölümü Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1942

Browse

Now showing 1 - 4 of 4

Citation - WoS: 6
Citation - Scopus: 6
A Strong Integer Programming Formulation for Hybrid Flowshop Scheduling
(Taylor & Francis, 2019) Ağralı, Semra; Ünal, A. Tamer; Taşkın, Z. Caner
We consider a hybrid flowshop scheduling problem that includes parallel unrelated discrete machines or batch processing machines in different stages of a production system. The problem is motivated by a bottleneck process within the production system of a transformer producer located in the Netherlands. We develop an integer programming model that minimises the total tardiness of jobs over a finite planning horizon. Our model is applicable to a wide range of production systems organised as hybrid flowshops. We strengthen our integer program by exploiting the special properties of some constraints in our formulation. We develop a decision support system (DSS) based on our proposed optimisation model. We compare the results of our initial optimisation model with an improved formulation as well as with a heuristic that was in use at the company before the implementation of our DSS. Our results show that the improved optimisation model significantly outperforms the heuristic and the initial optimisation model in terms of both the solution time and the strength of its linear programming relaxation.
Citation - WoS: 41
Citation - Scopus: 36
Electric Vehicle Routing With Flexible Time Windows: a Column Generation Solution Approach
(Taylor & Francis, 2020) Taş, Duygu
In this paper, we introduce the Electric Vehicle Routing Problem with Flexible Time Windows (EVRPFTW) in which vehicles are allowed to serve customers before and after the earliest and latest time window bounds, respectively. The objective of this problem is to assign electric vehicles to feasible routes and make schedules with minimum total cost that includes the traveling costs, the costs of using electric vehicles and the penalty costs incurred for earliness and lateness. The proposed mathematical model is solved by a column generation procedure. To generate an integer solution, we solve an integer programming problem using the routes constructed by the column generation algorithm. We further develop a linear programming model to compute the optimal times to start service at each customer for the selected routes. A number of wellknown benchmark instances is solved by our solution procedure to evaluate the operational gains obtained by employing flexible time windows.
Citation - WoS: 6
Citation - Scopus: 5
Optimal Keyword Bidding in Search-Based Advertising With Budget Constraint and Stochastic Ad Position
(Taylor & Francis, 2019) Özlük, Özgür; Selçuk, Barış; Küçükaydın, Hande
This paper analyses the search-based advertising problem from an advertiser’s view point, and proposes optimal bid prices for a set of keywords targeted for the advertising campaign. The advertiser aims to maximise its expected potential revenue given a total budget constraint from a search-based advertising campaign. Optimal bid prices are formulated by considering various characteristics of the keywords such that the expected revenue from a keyword is a function of the ad’s position on the search page, and the ad position is a stochastic function of both the bid price and the competitive landscape for that keyword. We explore this problem analytically and numerically in an effort to generate important managerial insights for campaign setters.
Citation - WoS: 5
Citation - Scopus: 5
Risk Averse Investment Strategies for a Private Electricity Generating Company in a Carbon Constrained Environment
(Taylor & Francis, 2019) Çanakoğlu, Ethem; Ağralı, Semra; Adıyeke, Esra
We study a private electricity generating company that plans to enter a partially regulated market that operates under an active cap and trade system. There are different types of thermal and renewable power plants that the company considers to invest in over a predetermined planning horizon. Thermal power plants may include a carbon capture and storage technology in order to comply with the carbon limitations. We develop a time-consistent multi-stage stochastic optimization model for this investment problem, where the objective is to minimize the conditional value at risk (CV@R) of the net present value of the profit obtained through the planning horizon. We implement the model for a hypothetical generating company located in Turkey. The results show that the developed model is appropriate for determining risk averse investment strategies for a company that operates under carbon restricted market conditions.

Browse

Browsing Endüstri Mühendisliği Bölümü Koleksiyonu by browse.metadata.publisher "Taylor & Francis"