default search action
Arianna Alfieri
Person information
- affiliation: Polytechnic University of Turin, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Mengyi Zhang, Arianna Alfieri, Andrea Matta:
Generation of mathematical programming representations for discrete event simulation models of timed petri nets. Discret. Event Dyn. Syst. 34(1): 1-19 (2024) - [j27]Erica Pastore, Arianna Alfieri, Andrea Matta, Barbara Previtali:
Analytical models for flow time estimation of additive manufacturing machines. Int. J. Prod. Res. 62(14): 5168-5184 (2024) - 2023
- [j26]Arianna Alfieri, Michele Garraffa, Erica Pastore, Fabio Salassa:
Permutation flowshop problems minimizing core waiting time and core idle time. Comput. Ind. Eng. 176: 108983 (2023) - 2021
- [j25]Arianna Alfieri, Shuyu Zhou, Rosario Scatamacchia, Steef L. van de Velde:
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop. 4OR 19(2): 265-288 (2021) - [j24]Arianna Alfieri, Alessandro Druetto, Andrea Grosso, Fabio Salassa:
Column generation for minimizing total completion time in a parallel-batching environment. J. Sched. 24(6): 569-588 (2021) - 2020
- [j23]Arianna Alfieri, Claudio Castiglione, Erica Pastore:
A multi-objective tabu search algorithm for product portfolio selection: A case study in the automotive industry. Comput. Ind. Eng. 142: 106382 (2020) - [j22]Arianna Alfieri, Andrea Matta, Erica Pastore:
The time buffer approximated Buffer Allocation Problem: A row-column generation approach. Comput. Oper. Res. 115: 104835 (2020) - [j21]Erica Pastore, Arianna Alfieri, Giulio Zotteri, John E. Boylan:
The impact of demand parameter uncertainty on the bullwhip effect. Eur. J. Oper. Res. 283(1): 94-107 (2020) - [c12]Mengyi Zhang, Andrea Matta, Arianna Alfieri:
Sample-Path Algorithm for Global Optimal Solution of Resource Allocation in Queueing Systems with Performance Constraints. WSC 2020: 2767-2778
2010 – 2019
- 2019
- [c11]Mengyi Zhang, Andrea Matta, Arianna Alfieri, Giulia Pedrielli:
Feasibility Cut Generation by Simulation: Server Allocation in Serial-Parallel Manufacturing Systems. WSC 2019: 3633-3644 - 2018
- [j20]Giulia Pedrielli, Andrea Matta, Arianna Alfieri, Mengyi Zhang:
Design and control of manufacturing systems: a discrete event optimisation methodology. Int. J. Prod. Res. 56(1-2): 543-564 (2018) - [c10]Mengyi Zhang, Andrea Matta, Arianna Alfieri, Giulia Pedrielli:
Simulation-based Benders Cuts: a New cutting Approach to Approximately solve simulation-Optimization Problems. WSC 2018: 2225-2236 - 2017
- [c9]Mengyi Zhang, Andrea Matta, Arianna Alfieri, Giulia Pedrielli:
A simulation-based benders' cuts generation for the joint workstation, workload and buffer allocation problem. CASE 2017: 1067-1072 - 2016
- [c8]Mengyi Zhang, Andrea Matta, Arianna Alfieri, Giulia Pedrielli:
A simulation based cut generation approach to improve DEO efficiency: The Buffer Allocation case. WSC 2016: 3710-3711 - 2015
- [j19]Arianna Alfieri, Andrea Matta, Giulia Pedrielli:
Mathematical programming models for joint simulation-optimization applied to closed queueing networks. Ann. Oper. Res. 231(1): 105-127 (2015) - [j18]Antonio Costa, Arianna Alfieri, Andrea Matta, Sergio Fichera:
A parallel tabu search for solving the primal buffer allocation problem in serial production systems. Comput. Oper. Res. 64: 97-112 (2015) - [c7]Giulia Pedrielli, Andrea Matta, Arianna Alfieri:
Discrete event optimization: single-run integrated simulation-optimization using mathematical programming. WSC 2015: 3557-3568 - 2014
- [c6]Giulia Pedrielli, Arianna Alfieri, Andrea Matta:
Time Buffer Control System for multi-stage production lines. CASE 2014: 393-398 - [c5]Andrea Matta, Giulia Pedrielli, Arianna Alfieri:
Event relationship graph lite: event based modeling for simulation-optimization of control policies in discrete event systems. WSC 2014: 3983-3994 - 2013
- [j17]Arianna Alfieri, Marco Cantamessa, Francesca Montagna, Elisabetta Raguseo:
Usage of SoS methodologies in production system design. Comput. Ind. Eng. 64(2): 562-572 (2013) - [j16]Arianna Alfieri, Andrea Matta:
Mathematical programming time-based decomposition algorithm for discrete event simulation. Eur. J. Oper. Res. 231(3): 557-566 (2013) - 2012
- [j15]Arianna Alfieri, Andrea Matta:
Mathematical programming formulations for approximate simulation of multistage production systems. Eur. J. Oper. Res. 219(3): 773-783 (2012) - [j14]Arianna Alfieri, Marco Cantamessa, Francesca Montagna:
The SoS approach for lean manufacturing systems. Int. J. Technol. Manag. 57(1/2/3): 149-165 (2012) - [j13]Arianna Alfieri, Andrea Matta:
Mathematical programming representation of pull controlled single-product serial manufacturing systems. J. Intell. Manuf. 23(1): 23-35 (2012) - [j12]Arianna Alfieri, Tullio Tolio, Marcello Urgo:
A project scheduling approach to production and material requirement planning in Manufacturing-to-Order environments. J. Intell. Manuf. 23(3): 575-585 (2012) - [j11]Arianna Alfieri, Marco Cantamessa, A. Monchiero, Francesca Montagna:
Heuristics for puzzle-based storage systems driven by a limited set of automated guided vehicles. J. Intell. Manuf. 23(5): 1695-1705 (2012) - [c4]Arianna Alfieri, Andrea Matta:
A time-based decomposition algorithm for fast simulation with mathematical programming models. WSC 2012: 231:1-231:12 - 2011
- [c3]Arianna Alfieri, Andrea Matta:
Simulation-optimization of flow lines: an lp-based bounding approach. WSC 2011: 4262-4273
2000 – 2009
- 2009
- [j10]Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
Single-Machine Scheduling Problems with Generalized Preemption. INFORMS J. Comput. 21(1): 1-12 (2009) - 2007
- [j9]Arianna Alfieri, Gaia Nicosia:
Minimum cost multi-product flow lines. Ann. Oper. Res. 150(1): 31-46 (2007) - [j8]Arianna Alfieri, Andrea Bianco, Paolo Brandimarte, Carla-Fabiana Chiasserini:
Maximizing system lifetime in wireless sensor networks. Eur. J. Oper. Res. 181(1): 390-402 (2007) - [j7]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll cutting in the curtain industry, or: A well-solvable allocation problem. Eur. J. Oper. Res. 183(3): 1397-1404 (2007) - [j6]Arianna Alfieri:
Due date quoting and scheduling interaction in production lines. Int. J. Comput. Integr. Manuf. 20(6): 579-587 (2007) - [j5]Arianna Alfieri, Leo G. Kroon, Steef L. van de Velde:
Personnel scheduling in a complex logistic system: a railway application case. J. Intell. Manuf. 18(2): 223-232 (2007) - 2006
- [j4]Arianna Alfieri, Gaia Nicosia, Andrea Pacifici:
Exact algorithms for a discrete metric labeling problem. Discret. Optim. 3(3): 181-194 (2006) - [j3]Arianna Alfieri, Rutger Groot, Leo G. Kroon, Alexander Schrijver:
Efficient Circulation of Railway Rolling Stock. Transp. Sci. 40(3): 378-391 (2006) - 2005
- [c2]Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll Cutting in the Curtain Industry. ESA 2005: 283-292 - 2004
- [j2]Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
A heuristic approach to batching and scheduling a single machine to minimize setup costs. Comput. Ind. Eng. 46(4): 793-802 (2004) - [c1]Arianna Alfieri, Andrea Bianco, Paolo Brandimarte, Carla-Fabiana Chiasserini:
Exploiting sensor spatial redundancy to improve network lifetime [wireless sensor networks]. GLOBECOM 2004: 3170-3176 - 2003
- [j1]Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. J. Sched. 6(1): 87-108 (2003)
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:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint