default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur Kramer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Beatrice Bolsi
, Thiago Alves de Queiroz, Vinícius Loti de Lima, Arthur Kramer, Manuel Iori:
Assigning multi-skill configurations to multiple servers with a Scenario-Based Planning and Recombination Approach. Comput. Oper. Res. 169: 106719 (2024)- [c3]Ruan Myller Magalhães de Oliveira, Manuel Iori, Arthur Kramer, Thiago Alves de Queiroz:
A Re-optimization Heuristic for a Dial-a-Ride Problem in the Transportation of Patients. MIC (1) 2024: 145-157 - 2023
- [j8]Thiago Alves de Queiroz, Manuel Iori, Arthur Kramer, Yong-Hong Kuo:
Dynamic scheduling of patients in emergency departments. Eur. J. Oper. Res. 310(1): 100-116 (2023) - 2022
- [c2]Thiago Alves de Queiroz, Beatrice Bolsi, Vinícius Loti de Lima, Manuel Iori, Arthur Kramer:
Assigning Multi-skill Configurations to Multiple Servers with a Reduced VNS. ICVNS 2022: 97-111 - 2021
- [j7]Raphael Kramer, Arthur Kramer:
An exact framework for the discrete parallel machine scheduling location problem. Comput. Oper. Res. 132: 105318 (2021) - [j6]Arthur Kramer, Manuel Iori, Philippe Lacomme:
Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization. Eur. J. Oper. Res. 289(3): 825-840 (2021) - [c1]Thiago Alves de Queiroz, Manuel Iori, Arthur Kramer, Yong-Hong Kuo:
Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search. ICVNS 2021: 138-151 - 2020
- [j5]Arthur Kramer:
Exact and heuristic algorithms for scheduling problems. 4OR 18(1): 123-124 (2020) - [j4]Arthur Kramer, Mauro Dell'Amico, Dominique Feillet, Manuel Iori:
Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time. Comput. Oper. Res. 123: 105018 (2020) - [i5]Raphael Kramer, Arthur Kramer:
Exact and heuristic methods for the discrete parallel machine scheduling location problem. CoRR abs/2006.08327 (2020) - [i4]Arthur Kramer, Clio Dosi, Manuel Iori, Matteo Vignoli:
Successful implementation of discrete event simulation: the case of an Italian emergency department. CoRR abs/2006.13062 (2020)
2010 – 2019
- 2019
- [j3]Arthur Kramer, Mauro Dell'Amico, Manuel Iori:
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. Eur. J. Oper. Res. 275(1): 67-79 (2019) - [j2]Arthur Kramer, Eduardo Lalla-Ruiz, Manuel Iori, Stefan Voß:
Novel formulations and modeling enhancements for the dynamic berth allocation problem. Eur. J. Oper. Res. 278(1): 170-185 (2019) - [j1]Arthur Kramer, Anand Subramanian:
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. J. Sched. 22(1): 21-57 (2019) - 2018
- [i3]Arthur Kramer, Mauro Dell'Amico, Manuel Iori:
Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. CoRR abs/1808.10661 (2018) - 2015
- [i2]Katyanne Farias, Arthur Kramer, Anand Subramanian:
Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. CoRR abs/1501.05882 (2015) - [i1]Arthur Kramer, Anand Subramanian:
A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems. CoRR abs/1509.02384 (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 2025-04-03 00:16 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:
