![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Meral Azizoglu
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Eda Göksoy Kalaycilar, Meral Azizoglu
, Sakine Batun
:
Disassembly line balancing with hazardous task failures - Model based solution approaches. Comput. Ind. Eng. 190: 110089 (2024) - [j29]Umutcan Ayasandir, Meral Azizoglu:
Two-dimensional cutting stock problem with multiple stock sizes. Int. J. Manuf. Technol. Manag. 38(2): 95-125 (2024) - 2022
- [j28]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): 3237-3262 (2022) - 2021
- [j27]Utku Girit, Meral Azizoglu
:
Rebalancing the assembly lines with total squared workload and total replacement distance objectives. Int. J. Prod. Res. 59(22): 6702-6720 (2021) - 2020
- [j26]Cansu Altintas, Meral Azizoglu
:
A Resource Constrained Project Scheduling Problem With Multi-Modes. Int. J. Inf. Technol. Proj. Manag. 11(1): 55-70 (2020) - [j25]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): 1-14 (2020)
2010 – 2019
- 2019
- [j24]Özlem Karsu
, Meral Azizoglu
:
An exact algorithm for the minimum squared load assignment problem. Comput. Oper. Res. 106: 76-90 (2019) - 2018
- [j23]Meral Azizoglu
, Sadullah Imat:
Workload smoothing in simple assembly line balancing. Comput. Oper. Res. 89: 51-57 (2018) - 2017
- [j22]Ece Sanci, Meral Azizoglu
:
Rebalancing the assembly lines: exact solution approaches. Int. J. Prod. Res. 55(20): 5991-6010 (2017) - 2016
- [j21]Eda Göksoy Kalaycilar, Meral Azizoglu
, Sencer Yeralan:
A disassembly line balancing problem with fixed number of workstations. Eur. J. Oper. Res. 249(2): 592-604 (2016) - 2014
- [j20]Erdem Colak, Meral Azizoglu
:
A resource investment problem with time/resource trade-offs. J. Oper. Res. Soc. 65(5): 777-790 (2014) - 2013
- [j19]Melih Ozlen
, Meral Azizoglu
, Benjamin A. Burton
:
Optimising a nonlinear utility function in multi-objective integer programming. J. Glob. Optim. 56(1): 93-102 (2013) - [j18]Guvenc 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): 1474-1484 (2013) - 2011
- [j17]Melih Özlen
, Meral Azizoglu
:
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria. J. Oper. Res. Soc. 62(1): 152-164 (2011) - 2010
- [j16]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): 676-685 (2010) - [j15]Selin Özpeynirci
, Meral Azizoglu
:
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems. J. Oper. Res. Soc. 61(5): 872-877 (2010)
2000 – 2009
- 2009
- [j14]Selin Bilgin, Meral Azizoglu
:
Operation assignment and capacity allocation problem in automated manufacturing systems. Comput. Ind. Eng. 56(2): 662-676 (2009) - [j13]Selin Bilgin Özpeynirci
, Meral Azizoglu
:
Beam search algorithm for capacity allocation problem in flexible manufacturing systems. Comput. Ind. Eng. 56(4): 1464-1473 (2009) - [j12]Yunus Ege, Meral Azizoglu
, Nur Evin Özdemirel:
Assembly line balancing with station paralleling. Comput. Ind. Eng. 57(4): 1218-1225 (2009) - [j11]Selin Özpeynirci
, Meral Azizoglu
:
Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems. Comput. Oper. Res. 36(9): 2531-2540 (2009) - [j10]Melih Özlen
, Meral Azizoglu
:
Multi-objective integer programming: A general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199(1): 25-35 (2009) - 2006
- [j9]Selin Bilgin, Meral Azizoglu
:
Capacity and tool allocation problem in flexible manufacturing systems. J. Oper. Res. Soc. 57(6): 670-681 (2006) - 2004
- [j8]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): 286-295 (2004) - 2003
- [j7]Meral Azizoglu
, Suna Kondakci Köksalan, Murat Köksalan:
Single machine scheduling with maximum earliness and number tardy. Comput. Ind. Eng. 45(2): 257-268 (2003) - [j6]Meral Azizoglu
:
Preemptive scheduling on identical parallel machines subject to deadlines. Eur. J. Oper. Res. 148(1): 205-210 (2003) - [j5]Oguzhan Alagöz
, Meral Azizoglu
:
Rescheduling of identical parallel machines under machine eligibility constraints. Eur. J. Oper. Res. 149(3): 523-532 (2003) - [j4]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): 661-664 (2003) - 2001
- [j3]Scott Webster, Meral Azizoglu
:
Dynamic programming algorithms for scheduling parallel machines with family setup times. Comput. Oper. Res. 28(2): 127-137 (2001) - [j2]Meral Azizoglu
, Ergin Çakmak, Suna Kondakci Köksalan:
A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res. 132(3): 528-538 (2001)
1990 – 1999
- 1999
- [j1]Meral Azizoglu
, Ömer Kirca:
On the minimization of total weighted flow time with identical and uniform parallel machines. Eur. J. Oper. Res. 113(1): 91-100 (1999)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint