![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Gündüz Ulusoy
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j14]Umut Besikci, Ümit Bilge, Gündüz Ulusoy:
Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling. Int. J. Math. Oper. Res. 14(4): 541-567 (2019) - 2015
- [j13]Umut Besikci, Ümit Bilge, Gündüz Ulusoy:
Multi-mode resource constrained multi-project scheduling and resource portfolio problem. Eur. J. Oper. Res. 240(1): 22-31 (2015) - 2014
- [j12]Anil Can, Gündüz Ulusoy:
Multi-project scheduling with two-stage decomposition. Ann. Oper. Res. 217(1): 95-116 (2014) - [c2]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: 219-247 - 2012
- [j11]O. Erhun Kundakcioglu
, Gündüz Ulusoy, Tonguç Ünlüyurt
:
Preface. Optim. Lett. 6(6): 1035-1037 (2012) - [c1]Gündüz Ulusoy, Gürhan Günday
, Kemal Kilic, Lütfihak Alpkan
:
Business Strategy and Innovativeness: Results from an Empirical Study. APMS (1) 2012: 685-692
2000 – 2009
- 2004
- [j10]Funda Sivrikaya-Serifoglu, Gündüz Ulusoy:
Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach. J. Oper. Res. Soc. 55(5): 504-512 (2004) - 2001
- [j9]Gündüz Ulusoy, Willy Herroelen:
Preface. Ann. Oper. Res. 102(1-4): 13-16 (2001) - [j8]Gündüz Ulusoy, Funda Sivrikaya-Serifoglu, Sule Önsel Sahin:
Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Ann. Oper. Res. 102(1-4): 237-261 (2001) - 2000
- [j7]Gündüz Ulusoy, Selçuk Karabati
:
Sixth International Workshop on Project Management and Scheduling. Eur. J. Oper. Res. 127(2): 217-219 (2000) - [j6]Gündüz Ulusoy, Serkan Cebelli:
An equitable approach to the payment scheduling problem in project management. Eur. J. Oper. Res. 127(2): 262-278 (2000)
1990 – 1999
- 1999
- [j5]Funda Sivrikaya-Serifoglu, Gündüz Ulusoy:
Parallel machine scheduling with earliness and tardiness penalties. Comput. Oper. Res. 26(8): 773-787 (1999) - 1998
- [j4]Funda Sivrikaya-Serifoglu, Gündüz Ulusoy:
A bicriteria two-machine permutation flowshop problem. Eur. J. Oper. Res. 107(2): 414-430 (1998) - 1997
- [j3]Gündüz Ulusoy, Funda Sivrikaya-Serifoglu, Ümit Bilge:
A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Comput. Oper. Res. 24(4): 335-351 (1997) - [j2]Ümit Bilge, Gündüz Ulusoy:
Letter to the Editor. Oper. Res. 45(2): 322 (1997) - 1995
- [j1]Ümit Bilge, Gündüz Ulusoy:
A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS. Oper. Res. 43(6): 1058-1070 (1995)
Coauthor Index
![](https://dblp.uni-trier.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 2025-01-09 13:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint