Meral Azizoglu

According to our database, Meral Azizoglu authored at least 30 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Two-dimensional cutting stock problem with multiple stock sizes.

Umutcan Ayasandir, Meral Azizoglu

Int. J. Manuf. Technol. Manag., 2024

Disassembly line balancing with hazardous task failures - Model based solution approaches.

Eda Göksoy Kalaycilar, Meral Azizoglu, Sakine Batun

Comput. Ind. Eng., 2024

2022

A stochastic programming approach for the disassembly line balancing with hazardous task failures.

Eda Göksoy Kalaycilar, Sakine Batun, Meral Azizoglu

Int. J. Prod. Res., 2022

2021

Rebalancing the assembly lines with total squared workload and total replacement distance objectives.

Utku Girit, Meral Azizoglu

Int. J. Prod. Res., 2021

2020

A Resource Constrained Project Scheduling Problem With Multi-Modes.

Cansu Altintas, Meral Azizoglu

Int. J. Inf. Technol. Proj. Manag., 2020

A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource.

Cansu Altintas, Meral Azizoglu

Int. J. Inf. Technol. Proj. Manag., 2020

2019

An exact algorithm for the minimum squared load assignment problem.

Özlem Karsu, Meral Azizoglu

Comput. Oper. Res., 2019

2018

Workload smoothing in simple assembly line balancing.

Meral Azizoglu, Sadullah Imat

Comput. Oper. Res., 2018

2017

Rebalancing the assembly lines: exact solution approaches.

Ece Sanci, Meral Azizoglu

Int. J. Prod. Res., 2017

2016

A disassembly line balancing problem with fixed number of workstations.

Eda Göksoy Kalaycilar, Meral Azizoglu, Sencer Yeralan

Eur. J. Oper. Res., 2016

2014

A resource investment problem with time/resource trade-offs.

Erdem Colak, Meral Azizoglu

J. Oper. Res. Soc., 2014

2013

Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem.

Guvenc Degirmenci, Meral Azizoglu

J. Oper. Res. Soc., 2013

Optimising a nonlinear utility function in multi-objective integer programming.

Melih Ozlen, Meral Azizoglu, Benjamin A. Burton

J. Glob. Optim., 2013

2011

Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria.

Melih Özlen, Meral Azizoglu

J. Oper. Res. Soc., 2011

2010

A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems.

Selin Özpeynirci, Meral Azizoglu

J. Oper. Res. Soc., 2010

Linear programming based approaches for the discrete time/cost trade-off problem in project networks.

A. Baykal Hafizoglu, Meral Azizoglu

J. Oper. Res. Soc., 2010

2009

Multi-objective integer programming: A general approach for generating all non-dominated solutions.

Melih Özlen, Meral Azizoglu

Eur. J. Oper. Res., 2009

Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems.

Selin Özpeynirci, Meral Azizoglu

Comput. Oper. Res., 2009

Beam search algorithm for capacity allocation problem in flexible manufacturing systems.

Selin Bilgin Özpeynirci, Meral Azizoglu

Comput. Ind. Eng., 2009

Assembly line balancing with station paralleling.

Yunus Ege, Meral Azizoglu, Nur Evin Özdemirel

Comput. Ind. Eng., 2009

Operation assignment and capacity allocation problem in automated manufacturing systems.

Selin Bilgin, Meral Azizoglu

Comput. Ind. Eng., 2009

2006

Capacity and tool allocation problem in flexible manufacturing systems.

Selin Bilgin, Meral Azizoglu

J. Oper. Res. Soc., 2006

2004

Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan.

Berkin Toktas, Meral Azizoglu, Suna Kondakci Köksalan

Eur. J. Oper. Res., 2004

2003

Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.

Meral Azizoglu, Murat Köksalan, Suna Kondakci Köksalan

J. Oper. Res. Soc., 2003

Preemptive scheduling on identical parallel machines subject to deadlines.

Meral Azizoglu

Eur. J. Oper. Res., 2003

Rescheduling of identical parallel machines under machine eligibility constraints.

Oguzhan Alagöz, Meral Azizoglu

Eur. J. Oper. Res., 2003

Single machine scheduling with maximum earliness and number tardy.

Meral Azizoglu, Suna Kondakci Köksalan, Murat Köksalan

Comput. Ind. Eng., 2003

2001

A flexible flowshop problem with total flow time minimization.

Meral Azizoglu, Ergin Çakmak, Suna Kondakci Köksalan

Eur. J. Oper. Res., 2001

Dynamic programming algorithms for scheduling parallel machines with family setup times.

Scott Webster, Meral Azizoglu

Comput. Oper. Res., 2001

1999

On the minimization of total weighted flow time with identical and uniform parallel machines.

Meral Azizoglu, Ömer Kirca

Eur. J. Oper. Res., 1999