Kerem Bulbul
Kerem Bulbul
Principal Applied Scientist, Amazon Web Services
Verified email at
Cited by
Cited by
Solving a robust airline crew pairing problem with column generation
İ Muter, Ş İlker Birbil, K Bülbül, G Şahin, H Yenigün, D Taş, D Tüzün
Computers & Operations Research 40 (3), 815-830, 2013
Preemption in single machine earliness/tardiness scheduling
K Bülbül, P Kaminsky, C Yano
Journal of scheduling 10 (4), 271-292, 2007
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
I Muter, Şİ Birbil, K Bülbül
Mathematical Programming 142 (1-2), 47-82, 2013
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs
K Bülbül, P Kaminsky, C Yano
Naval Research Logistics (NRL) 51 (3), 407-445, 2004
The set covering problem revisited: an empirical study of the value of dual information
B Yelbay, Şİ Birbil, K Bülbül
Journal of Industrial and Management Optimization 11 (2), 575-594, 2015
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
K Bülbül
Computers & Operations Research 38 (6), 967-983, 2011
A survey on multi trip vehicle routing problem
A Şen, K Bülbül
İstanbul Bilgi Üniversitesi, 2008
Robust crew pairing for managing extra flights
H Tekiner, Şİ Birbil, K Bülbül
Computers & Operations Research 36 (6), 2031-2048, 2009
A linear programming-based method for job shop scheduling
K Bülbül, P Kaminsky
Journal of Scheduling 16 (2), 161-183, 2013
Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design
Ö Elçi, N Noyan, K Bülbül
Computers & Operations Research 96, 91-107, 2018
Minimizing value-at-risk in single-machine scheduling
S Atakan, K Bülbül, N Noyan
Annals of Operations Research 248 (1), 25-73, 2017
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
K Bülbül, H Şen
Journal of Scheduling 20 (4), 373-389, 2017
A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
H Şen, K Bülbül
Informs Journal on Computing 27 (1), 135-150, 2015
The job shop scheduling problem with convex costs
R Bürgy, K Bülbül
European Journal of Operational Research 268 (1), 82-100, 2018
On EOQ Cost Models with Arbitrary Purchase and Transportation Costs
Şİ Birbil, K Bülbül, H Frenk, HM Mulder
Journal of Industrial and Management Optimization 11 (4), 1211-1245, 2015
Single-machine common due date total earliness/tardiness scheduling with machine unavailability
K Bulbul, S Kedad-Sidhoum, H Sen
Journal of Scheduling 22 (5), 543-565, 2019
Dynamic resource constrained multi-project scheduling problem with weighted earliness/tardiness costs
MB Pamay, K Bülbül, G Ulusoy
Essays in Production, Project Planning and Scheduling: A Festschrift in …, 2014
Benders Decomposition and Column-and-Row Generation for Solving Large-Scale Linear Programs with Column-Dependent-Rows
I Muter, Şİ Birbil, K Bülbül
European Journal of Operational Research 264 (1), 29-45, 2018
Multi-stage stochastic programming models for provisioning cloud computing resources
K Bülbül, N Noyan, H Erol
European Journal of Operational Research 288 (3), 886-901, 2021
Hop constrained energy-efficient broadcasting: insights from massively dense ad hoc networks
K Bulbul, O Ercetin, T Unluyurt
Mobile Computing, IEEE Transactions on 8 (2), 188-202, 2009
The system can't perform the operation now. Try again later.
Articles 1–20