default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa Arslan Ornek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]S. Serhat Karakutuk
, Sener Akpinar, Mustafa Arslan Ornek:
A two-stage real world serial batching scheduling problem: a case study. J. Oper. Res. Soc. 75(12): 2392-2403 (2024)- 2023
- [j12]S. Serhat Karakutuk, Mustafa Arslan Ornek:
A goal programming approach to lean production system implementation. J. Oper. Res. Soc. 74(1): 403-416 (2023) - 2022
- [j11]Mustafa Arslan Ornek, Cemalettin Ozturk, Ipek Sugut:
Integer and constraint programming model formulations for flight-gate assignment problem. Oper. Res. 22(1): 135-163 (2022)
2010 – 2019
- 2015
- [j10]Banu Yetkin Ekren, Mustafa Arslan Ornek:
Determining optimum (s, S) levels of floor stock items in a paint production environment. Simul. Model. Pract. Theory 57: 133-141 (2015) - 2013
- [j9]Cemalettin Öztürk, Semra Tunali, Brahim Hnich, Mustafa Arslan Ornek:
Balancing and scheduling of flexible mixed model assembly lines. Constraints An Int. J. 18(3): 434-469 (2013) - [c1]Cemalettin Öztürk, Semra Tunali, Brahim Hnich, Mustafa Arslan Ornek:
Cyclic Scheduling of Flexible Mixed Model Assembly Lines. MIM 2013: 857-862 - 2012
- [j8]Cemalettin Öztürk, Mustafa Arslan Ornek:
A MIP based heuristic for capacitated MRP systems. Comput. Ind. Eng. 63(4): 926-942 (2012) - 2010
- [j7]Cemalettin Öztürk, Mustafa Arslan Ornek:
Capacitated lot sizing with linked lots for general product structures in job shops. Comput. Ind. Eng. 58(1): 151-164 (2010) - [j6]Cemalettin Öztürk, Semra Tunali, Brahim Hnich, Mustafa Arslan Ornek:
Simultaneous Balancing and Scheduling of Flexible Mixed Model Assembly Lines with Sequence-Dependent Setup Times. Electron. Notes Discret. Math. 36: 65-72 (2010) - [j5]Mustafa Arslan Ornek, Selin Özpeynirci, Cemalettin Öztürk:
A note on "A mixed integer programming model for advanced planning and scheduling (APS)". Eur. J. Oper. Res. 203(3): 784-785 (2010)
2000 – 2009
- 2009
- [j4]Kamil Erkan Kabak, Mustafa Arslan Ornek:
An improved metric for measuring multi-item multi-level schedule instability under rolling schedules. Comput. Ind. Eng. 56(2): 691-707 (2009) - [j3]Rahime Sancar Edis, Mustafa Arslan Ornek:
Simulation analysis of lot streaming in job shops with transportation queue disciplines. Simul. Model. Pract. Theory 17(2): 442-453 (2009) - 2008
- [j2]Banu Yetkin Ekren, Mustafa Arslan Ornek:
A simulation based experimental design to analyze factors affecting production flow time. Simul. Model. Pract. Theory 16(3): 278-293 (2008) - 2007
- [j1]Esra Ekinci, Mustafa Arslan Ornek:
A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy. Adv. Decis. Sci. 2007: 53606:1-53606:18 (2007)
Coauthor Index
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-26 23:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
