Meral Azizoglu

According to our database1, Meral Azizoglu authored at least 25 papers between 1999 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Branch and Bound Algorithm for a Multi-Mode Project Scheduling Problem With a Single Non-Renewable Resource.
Int. J. Inf. Technol. Proj. Manag., 2020

2019
An exact algorithm for the minimum squared load assignment problem.
Comput. Oper. Res., 2019

2018
Workload smoothing in simple assembly line balancing.
Comput. Oper. Res., 2018

2017
Rebalancing the assembly lines: exact solution approaches.
Int. J. Prod. Res., 2017

2016
A disassembly line balancing problem with fixed number of workstations.
Eur. J. Oper. Res., 2016

2014
A resource investment problem with time/resource trade-offs.
J. Oper. Res. Soc., 2014

2013
Branch and bound based solution algorithms for the budget constrained discrete time/cost trade-off problem.
J. Oper. Res. Soc., 2013

Optimising a nonlinear utility function in multi-objective integer programming.
J. Glob. Optim., 2013

2011
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria.
J. Oper. Res. Soc., 2011

2010
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems.
J. Oper. Res. Soc., 2010

Linear programming based approaches for the discrete time/cost trade-off problem in project networks.
J. Oper. Res. Soc., 2010

2009
Multi-objective integer programming: A general approach for generating all non-dominated solutions.
Eur. J. Oper. Res., 2009

Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems.
Comput. Oper. Res., 2009

Beam search algorithm for capacity allocation problem in flexible manufacturing systems.
Comput. Ind. Eng., 2009

Assembly line balancing with station paralleling.
Comput. Ind. Eng., 2009

Operation assignment and capacity allocation problem in automated manufacturing systems.
Comput. Ind. Eng., 2009

2006
Capacity and tool allocation problem in flexible manufacturing systems.
J. Oper. Res. Soc., 2006

2004
Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan.
Eur. J. Oper. Res., 2004

2003
Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed.
J. Oper. Res. Soc., 2003

Preemptive scheduling on identical parallel machines subject to deadlines.
Eur. J. Oper. Res., 2003

Rescheduling of identical parallel machines under machine eligibility constraints.
Eur. J. Oper. Res., 2003

Single machine scheduling with maximum earliness and number tardy.
Comput. Ind. Eng., 2003

2001
A flexible flowshop problem with total flow time minimization.
Eur. J. Oper. Res., 2001

Dynamic programming algorithms for scheduling parallel machines with family setup times.
Comput. Oper. Res., 2001

1999
On the minimization of total weighted flow time with identical and uniform parallel machines.
Eur. J. Oper. Res., 1999


  Loading...