default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Paul M. Arnaout
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]Jean-Paul Arnaout
, John El Khoury:
Adaptation of WO to the Euclidean location-allocation with unknown number of facilities. Ann. Oper. Res. 315(1): 57-72 (2022)- 2020
- [j13]Jean-Paul Arnaout:
A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Ann. Oper. Res. 285(1): 273-293 (2020) - [j12]Jean-Paul Arnaout, Caline El Khoury, Gamze Karayaz:
Solving the multiple level warehouse layout problem using ant colony optimization. Oper. Res. 20(1): 473-490 (2020)
2010 – 2019
- 2019
- [j11]John El Khoury, Joud Khoury, Germain Zouein, Jean-Paul Arnaout:
A practical decentralized access protocol for autonomous vehicles at isolated under-saturated intersections. J. Intell. Transp. Syst. 23(5): 427-440 (2019) - 2018
- [j10]Jean-Paul Arnaout:
Worm optimization for the multiple level warehouse layout problem. Ann. Oper. Res. 269(1-2): 29-51 (2018) - [j9]Saeed Askary, Jean-Paul M. Arnaout, Naser Abughazaleh:
Audit evidences and modelling audit risk using goal programming. Int. J. Appl. Decis. Sci. 11(1): 18-35 (2018) - 2017
- [j8]Jean-Paul Arnaout:
Heuristics for the two-machine scheduling problem with a single server. Int. Trans. Oper. Res. 24(6): 1347-1355 (2017) - 2014
- [j7]Jean-Paul Arnaout, Rami Musa, Ghaith Rabadi:
A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines - part II: enhancements and experimentations. J. Intell. Manuf. 25(1): 43-53 (2014) - [c6]Jean-Paul Arnaout:
Bio-inspired algorithm for the Two-Machine Scheduling Problem with a Single Server. BICT 2014 - 2013
- [j6]Jean-Paul Arnaout:
Ant colony optimization algorithm for the Euclidean location-allocation problem with unknown number of facilities. J. Intell. Manuf. 24(1): 45-54 (2013) - [c5]Jean-Paul Arnaout, Samar Hallab, Caline El Khoury:
A throughput simulation of Port of Beirut. SpringSim (EAIA) 2013: 2 - 2012
- [j5]Charbel Rizk, Jean-Paul Arnaout:
ACO for the Surgical Cases Assignment Problem. J. Medical Syst. 36(3): 1891-1899 (2012) - [c4]Caline El Khoury, Jean-Paul Arnaout:
Metaheuristic for the Multiple Level Warehouse Layout Problem. MS 2012: 240-248 - 2010
- [j4]Rami Musa, Jean-Paul M. Arnaout, Hosang Jung:
Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Comput. Ind. Eng. 59(1): 85-92 (2010) - [j3]Jean-Paul M. Arnaout, Marwan Maatouk:
Optimization of quality and operational costs through improved scheduling of harvest operations. Int. Trans. Oper. Res. 17(5): 595-605 (2010) - [j2]Jean-Paul Arnaout, Ghaith Rabadi, Rami Musa:
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J. Intell. Manuf. 21(6): 693-701 (2010) - [j1]Jean-Paul M. Arnaout:
Heuristics for the Maximization of Operating Rooms Utilization Using Simulation. Simul. 86(8-9): 573-583 (2010)
2000 – 2009
- 2008
- [c3]Jean-Paul Arnaout, Rami Musa, Ghaith Rabadi:
Ant colony optimization algorithm to parallel machine scheduling problem with setups. CASE 2008: 578-582 - [c2]Jean-Paul M. Arnaout, Sevag Kulbashian:
Maximizing the utilization of operating rooms with stochastic times using simulation. WSC 2008: 1617-1623 - 2005
- [c1]Jean-Paul M. Arnaout, Ghaith Rabadi:
Minimizing the total weighted completion time on unrelated parallel machines with stochastic times. WSC 2005: 2141-2147
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-07 22:12 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:
