Kerem Bülbül

Publication Activity (10 Years)

Years Active: 2005-2021
Publications (10 Years): 8

Top Topics

Computing Resources

Weighted Tardiness

Unrelated Parallel Machines

Job Shop Scheduling

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Ann. Oper. Res.

Publications

Kerem Bülbül, Nilay Noyan, Hazal Erol
Multi-stage stochastic programming models for provisioning cloud computing resources. Eur. J. Oper. Res. 288 (3) (2021)
Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen
Single-machine common due date total earliness/tardiness scheduling with machine unavailability. J. Sched. 22 (5) (2019)
Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül
Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows. Eur. J. Oper. Res. 264 (1) (2018)
Özgün Elçi, Nilay Noyan, Kerem Bülbül
Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design. Comput. Oper. Res. 96 (2018)
Reinhard Bürgy, Kerem Bülbül
The job shop scheduling problem with convex costs. Eur. J. Oper. Res. 268 (1) (2018)
Semih Atakan, Kerem Bülbül, Nilay Noyan
Minimizing value-at-risk in single-machine scheduling. Ann. Oper. Res. 248 (1-2) (2017)
Kerem Bülbül, Halil Sen
An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J. Sched. 20 (4) (2017)
Belma Yelbay, S. Ilker Birbil, Kerem Bülbül, Hasan M. Jamil
Approximating the minimum hub cover problem on planar graphs. Optim. Lett. 10 (1) (2016)
Halil Sen, Kerem Bülbül
A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines. INFORMS J. Comput. 27 (1) (2015)
M. Berke Pamay, Kerem Bülbül, Gündüz Ulusoy
Dynamic Resource Constrained Multi-Project Scheduling Problem with Weighted Earliness/Tardiness Costs. Essays in Production, Project Planning and Scheduling (2014)
Belma Yelbay, S. Ilker Birbil, Kerem Bülbül, Hasan M. Jamil
Trade-offs Computing Minimum Hub Cover toward Optimized Graph Query Processing. CoRR (2013)
Kerem Bülbül, Philip M. Kaminsky
A linear programming-based method for job shop scheduling. J. Sched. 16 (2) (2013)
Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Math. Program. 142 (1-2) (2013)
Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül, Güvenç Sahin, Hüsnü Yenigün, Duygu Tas, Dilek Tüzün
Solving a robust airline crew pairing problem with column generation. Comput. Oper. Res. 40 (3) (2013)
Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül, Güvenç Sahin
A note on "A LP-based heuristic for a time-constrained routing problem". Eur. J. Oper. Res. 221 (2) (2012)
Kerem Bülbül
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38 (6) (2011)
Kerem Bülbül, Özgür Erçetin, Tonguç Ünlüyurt
Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks. IEEE Trans. Mob. Comput. 8 (2) (2009)
Hatice Tekiner, S. Ilker Birbil, Kerem Bülbül
Robust crew pairing for managing extra flights. Comput. Oper. Res. 36 (6) (2009)
Serkan Çiftlikli, Figen Öztoprak, Özgür Erçetin, Kerem Bülbül
Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting. Int. J. Interdiscip. Telecommun. Netw. 1 (2) (2009)
Kerem Bülbül, Özgür Erçetin, Tonguç Ünlüyurt
Delay Constrained Minimum Power Broadcasting in Wireless Networks. WiOpt (2007)
Kerem Bülbül, Özgür Erçetin
Wireless Systems Maximum precision-lifetime curve for joint sensor selection and data routing in sensor networks. Eur. Trans. Telecommun. 18 (7) (2007)
Özgür Erçetin, Özgür Gürbüz, Kerem Bülbül, Ertugrul Necdet Ciftcioglu, Aylin Aksu
A Practical Routing and MAC Framework for Maximum Lifetime Sensor Telemetry. IEICE Trans. Commun. (11) (2007)
Özgür Erçetin, Özgür Gürbüz, Kerem Bülbül, Aylin Aksu
Joint Sensor Selection and Data Routing in Sensor Networks. NETWORKING (2005)