default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaoucine Kerbache
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Zhitao Xu
, Adel Elomri, Roberto Baldacci, Laoucine Kerbache, Zhenyong Wu:
Correction: Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 335(1): 639 (2024)- [j11]Zhitao Xu, Adel Elomri, Roberto Baldacci, Laoucine Kerbache, Zhenyong Wu:
Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 338(2): 1359-1401 (2024) - [c2]Abdullah Riad, Majed Hadid, Adel Elomri, Laoucine Kerbache, Abdelfatteh El Omri:
Robotics in Surgeries: Surgical Robot Operation and Workflow Optimization. ICIT 2024: 1-5 - [c1]Areej Althabatah, Mohammed Yaqot, Regina Padmanabhan, Laoucine Kerbache:
Fuzzy Maturity Model for Transformative Procurement Readiness: Procurement 4.0 Perspective. APMS (4) 2024: 32-47 - 2023
- [j10]Nour El Houda Tellache, Laoucine Kerbache:
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan. Comput. Oper. Res. 156: 106247 (2023)
2010 – 2019
- 2015
- [j9]Masayasu Nagashima, Marc Lassagne, Michiya Morita, Laoucine Kerbache:
Dynamic adaptation of supply chain collaboration to enhance demand controllability. Int. J. Manuf. Technol. Manag. 29(3/4): 139-160 (2015) - 2014
- [j8]Laoucine Kerbache, Christian van Delft:
Efficient purchaser incentive when dealing with suppliers implementing continuous improvement plans. Int. Trans. Oper. Res. 21(4): 673-701 (2014) - 2012
- [j7]Kai Luo, Laoucine Kerbache, Mozart B. C. Menezes, Christian van Delft:
A generalized single product and single-period inventory problem with non-linear parameters. Int. Trans. Oper. Res. 19(3): 421-433 (2012) - 2010
- [j6]Tom Van Woensel, R. Andriansyah, Frederico R. B. Cruz, James MacGregor Smith, Laoucine Kerbache:
Buffer and server allocation in general multi-server queueing networks. Int. Trans. Oper. Res. 17(2): 257-286 (2010) - [j5]Peter J. Danaher, Janghyuk Lee, Laoucine Kerbache:
Optimal Internet Media Selection. Mark. Sci. 29(2): 336-347 (2010)
2000 – 2009
- 2008
- [j4]Tom Van Woensel, Laoucine Kerbache, Herbert Peremans, Nico Vandaele:
Vehicle routing with dynamic travel times: A queueing approach. Eur. J. Oper. Res. 186(3): 990-1007 (2008) - 2007
- [j3]Tom Van Woensel, Laoucine Kerbache, Herbert Peremans, Nico Vandaele:
A Queueing Framework for Routing Problems with Time-dependent Travel Times. J. Math. Model. Algorithms 6(1): 151-173 (2007) - 2000
- [j2]Laoucine Kerbache, James MacGregor Smith:
Multi-objective routing within large scale facilities using open finite queueing networks. Eur. J. Oper. Res. 121(1): 105-123 (2000)
1980 – 1989
- 1988
- [j1]Laoucine Kerbache, J. MacGregor Smith:
Asymptotic behavior of the expansion method for open finite queueing networks. Comput. Oper. Res. 15(2): 157-169 (1988)
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-10-16 21:27 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:
