Meral Azizoglu

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 10

Top Topics

Branch And Bound Algorithm

Scheduling Problem

Orthogonal Projection

Top Venues

Int. J. Prod. Res.

Comput. Oper. Res.

Int. J. Inf. Technol. Proj. Manag.

Int. J. Manuf. Technol. Manag.

Publications

Eda Göksoy Kalaycilar, Meral Azizoglu, Sakine Batun
Disassembly line balancing with hazardous task failures - Model based solution approaches. Comput. Ind. Eng. 190 (2024)
Umutcan Ayasandir, Meral Azizoglu
Two-dimensional cutting stock problem with multiple stock sizes. Int. J. Manuf. Technol. Manag. 38 (2) (2024)
Eda Göksoy Kalaycilar, Sakine Batun, Meral Azizoglu
A stochastic programming approach for the disassembly line balancing with hazardous task failures. Int. J. Prod. Res. 60 (10) (2022)
Utku Girit, Meral Azizoglu
Rebalancing the assembly lines with total squared workload and total replacement distance objectives. Int. J. Prod. Res. 59 (22) (2021)
Cansu Altintas, Meral Azizoglu
A Resource Constrained Project Scheduling Problem With Multi-Modes. Int. J. Inf. Technol. Proj. Manag. 11 (1) (2020)
Cansu Altintas, Meral Azizoglu
A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource. Int. J. Inf. Technol. Proj. Manag. 11 (2) (2020)
Özlem Karsu, Meral Azizoglu
An exact algorithm for the minimum squared load assignment problem. Comput. Oper. Res. 106 (2019)
Meral Azizoglu, Sadullah Imat
Workload smoothing in simple assembly line balancing. Comput. Oper. Res. 89 (2018)
Ece Sanci, Meral Azizoglu
Rebalancing the assembly lines: exact solution approaches. Int. J. Prod. Res. 55 (20) (2017)
Eda Göksoy Kalaycilar, Meral Azizoglu, Sencer Yeralan
A disassembly line balancing problem with fixed number of workstations. Eur. J. Oper. Res. 249 (2) (2016)
Erdem Colak, Meral Azizoglu
A resource investment problem with time/resource trade-offs. J. Oper. Res. Soc. 65 (5) (2014)
G. Degirmenci, Meral Azizoglu
Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem. J. Oper. Res. Soc. 64 (10) (2013)
Melih Ozlen, Meral Azizoglu, Benjamin A. Burton
Optimising a nonlinear utility function in multi-objective integer programming. J. Glob. Optim. 56 (1) (2013)
Melih Özlen, Meral Azizoglu
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria. J. Oper. Res. Soc. 62 (1) (2011)
Selin Özpeynirci, Meral Azizoglu
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems. J. Oper. Res. Soc. 61 (5) (2010)
A. Baykal Hafizoglu, Meral Azizoglu
Linear programming based approaches for the discrete time/cost trade-off problem in project networks. J. Oper. Res. Soc. 61 (4) (2010)
Selin Özpeynirci, Meral Azizoglu
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems. Comput. Oper. Res. 36 (9) (2009)
Melih Özlen, Meral Azizoglu
Multi-objective integer programming: A general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199 (1) (2009)
Selin Bilgin Özpeynirci, Meral Azizoglu
Beam search algorithm for capacity allocation problem in flexible manufacturing systems. Comput. Ind. Eng. 56 (4) (2009)
Yunus Ege, Meral Azizoglu, Nur Evin Özdemirel
Assembly line balancing with station paralleling. Comput. Ind. Eng. 57 (4) (2009)
Selin Bilgin, Meral Azizoglu
Operation assignment and capacity allocation problem in automated manufacturing systems. Comput. Ind. Eng. 56 (2) (2009)
Selin Bilgin, Meral Azizoglu
Capacity and tool allocation problem in flexible manufacturing systems. J. Oper. Res. Soc. 57 (6) (2006)
Berkin Toktas, Meral Azizoglu, Suna Kondakci Köksalan
Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. Eur. J. Oper. Res. 157 (2) (2004)
Meral Azizoglu, Suna Kondakci Köksalan, Murat Köksalan
Single machine scheduling with maximum earliness and number tardy. Comput. Ind. Eng. 45 (2) (2003)
Oguzhan Alagöz, Meral Azizoglu
Rescheduling of identical parallel machines under machine eligibility constraints. Eur. J. Oper. Res. 149 (3) (2003)
Meral Azizoglu, Murat Köksalan, Suna Kondakci Köksalan
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed. J. Oper. Res. Soc. 54 (6) (2003)
Meral Azizoglu
Preemptive scheduling on identical parallel machines subject to deadlines. Eur. J. Oper. Res. 148 (1) (2003)
Scott Webster, Meral Azizoglu
Dynamic programming algorithms for scheduling parallel machines with family setup times. Comput. Oper. Res. 28 (2) (2001)
Meral Azizoglu, Ergin Çakmak, Suna Kondakci Köksalan
A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res. 132 (3) (2001)
Meral Azizoglu, Ömer Kirca
On the minimization of total weighted flow time with identical and uniform parallel machines. Eur. J. Oper. Res. 113 (1) (1999)