default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIbrahim Kucukkoc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Zixiang Li, Celso Gustavo Stall Sikora, Ibrahim Kucukkoc
:
Chance-constrained stochastic assembly line balancing with branch, bound and remember algorithm. Ann. Oper. Res. 335(1): 491-516 (2024)- [j21]Ibrahim Kucukkoc, Gülsen Aydin Keskin, Aslan Deniz Karaoglan, Sevgi Karadag:
A hybrid discrete differential evolution - genetic algorithm approach with a new batch formation mechanism for parallel batch scheduling considering batch delivery. Int. J. Prod. Res. 62(1-2): 460-482 (2024) - 2023
- [j20]Yuchen Li, Dan Liu, Ibrahim Kucukkoc:
Mixed-model assembly line balancing problem considering learning effect and uncertain demand. J. Comput. Appl. Math. 422: 114823 (2023) - [c3]Enes Demiralay, Seyed Mohammad Javad Razavi, Ibrahim Kucukkoc, Mirco Peron:
An Environmental Decision Support System for Determining On-site or Off-site Additive Manufacturing of Spare Parts. APMS (2) 2023: 563-574 - 2021
- [j19]Zixiang Li, Ibrahim Kucukkoc, Qiuhua Tang:
Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem. Comput. Oper. Res. 131: 105235 (2021) - [j18]Yuchen Li, Ibrahim Kucukkoc, Xiaowen Tang:
Two-sided assembly line balancing that considers uncertain task time attributes and incompatible task sets. Int. J. Prod. Res. 59(6): 1736-1756 (2021) - 2020
- [j17]Yuchen Li, Rui Peng, Ibrahim Kucukkoc, Xiaowen Tang, Fang Wei:
System reliability optimization for an assembly line under uncertain random environment. Comput. Ind. Eng. 146: 106540 (2020) - [j16]Ibrahim Kucukkoc:
Balancing of two-sided disassembly lines: Problem definition, MILP model and genetic algorithm approach. Comput. Oper. Res. 124: 105064 (2020) - [j15]Zixiang Li, Ibrahim Kucukkoc, Zikai Zhang:
Branch, bound and remember algorithm for two-sided assembly line balancing problem. Eur. J. Oper. Res. 284(3): 896-905 (2020) - [j14]Zixiang Li, Zeynel Abidin Çil, Süleyman Mete, Ibrahim Kucukkoc:
A fast branch, bound and remember algorithm for disassembly line balancing problem. Int. J. Prod. Res. 58(11): 3220-3234 (2020) - [j13]Zixiang Li, Ibrahim Kucukkoc, Qiuhua Tang:
A comparative study of exact methods for the simple assembly line balancing problem. Soft Comput. 24(15): 11459-11475 (2020) - [c2]Ibrahim Kucukkoc, Zixiang Li, Qiang Li:
2D Nesting and Scheduling in Metal Additive Manufacturing. ICPR-Americas (1) 2020: 97-112
2010 – 2019
- 2019
- [j12]Zixiang Li, Ibrahim Kucukkoc, Zikai Zhang:
Iterated local search method and mathematical model for sequence-dependent U-shaped disassembly line balancing problem. Comput. Ind. Eng. 137 (2019) - [j11]Ibrahim Kucukkoc:
MILP models to minimise makespan in additive manufacturing machine scheduling problems. Comput. Oper. Res. 105: 58-67 (2019) - [j10]Ibrahim Kucukkoc, Kadir Büyüközkan, Sule Itir Satoglu, David Z. Zhang:
A mathematical model and artificial bee colony algorithm for the lexicographic bottleneck mixed-model assembly line balancing problem. J. Intell. Manuf. 30(8): 2913-2925 (2019) - 2018
- [j9]Zixiang Li, Ibrahim Kucukkoc, Zikai Zhang:
Branch, bound and remember algorithm for U-shaped assembly line balancing problem. Comput. Ind. Eng. 124: 24-35 (2018) - 2017
- [j8]Zixiang Li, Ibrahim Kucukkoc, Qiuhua Tang:
New MILP model and station-oriented ant colony optimization algorithm for balancing U-type assembly lines. Comput. Ind. Eng. 112: 107-121 (2017) - [j7]Qiang Li, Ibrahim Kucukkoc, David Z. Zhang:
Production planning in additive manufacturing and 3D printing. Comput. Oper. Res. 83: 157-172 (2017) - [j6]Zixiang Li, Ibrahim Kucukkoc, J. Mukund Nilakantan:
Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem. Comput. Oper. Res. 84: 146-161 (2017) - [j5]Ibrahim Kucukkoc, David Z. Zhang:
Balancing of mixed-model parallel U-shaped assembly lines considering model sequences. Int. J. Prod. Res. 55(20): 5958-5975 (2017) - [c1]Ibrahim Kucukkoc:
A Non-dominated Sorting Approach to Bi-objective Optimisation of Mixed-Model Two-Sided Assembly Lines. LSSC 2017: 374-381 - 2016
- [j4]Ibrahim Kucukkoc, David Z. Zhang:
Mixed-model parallel two-sided assembly line balancing problem: A flexible agent-based ant colony optimization approach. Comput. Ind. Eng. 97: 58-72 (2016) - [j3]Kadir Büyüközkan, Ibrahim Kucukkoc, Sule Itir Satoglu, David Z. Zhang:
Lexicographic bottleneck mixed-model assembly line balancing problem: Artificial bee colony and tabu search approaches with optimised parameters. Expert Syst. Appl. 50: 151-166 (2016) - 2015
- [j2]Ibrahim Kucukkoc, David Z. Zhang:
Type-E parallel two-sided assembly line balancing problem: Mathematical model and ant colony optimisation based approach with optimised parameters. Comput. Ind. Eng. 84: 56-69 (2015) - [j1]Ibrahim Kucukkoc, David Z. Zhang:
Balancing of parallel U-shaped assembly lines. Comput. Oper. Res. 64: 233-244 (2015)
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 2024-08-10 01:21 CEST 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:
