Alessandro Agnetis
Orcid: 0000-0001-5803-0438Affiliations:
- University of Siena, Italy
According to our database1,
Alessandro Agnetis
authored at least 63 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on dii.unisi.it
On csauthors.net:
Bibliography
2024
2023
Comput. Ind. Eng., September, 2023
Int. J. Prod. Res., April, 2023
2022
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations.
Oper. Res. Lett., 2022
Comput. Oper. Res., 2022
Locating platforms and scheduling a fleet of drones for emergency delivery of perishable items.
Comput. Ind. Eng., 2022
2021
Eur. J. Oper. Res., 2021
2020
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines.
Oper. Res. Lett., 2020
Ann. Oper. Res., 2020
2019
Eur. J. Oper. Res., 2019
Algorithms, 2019
2017
Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence.
J. Sched., 2017
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops.
Optim. Lett., 2017
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game.
Networks, 2017
Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs.
Int. J. Prod. Res., 2017
Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions.
Comput. Oper. Res., 2017
2016
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016
2015
Nash equilibria for the multi-agent project scheduling problem with controllable processing times.
J. Sched., 2015
Eur. J. Oper. Res., 2015
2014
Coordination of production and interstage batch delivery with outsourced distribution.
Eur. J. Oper. Res., 2014
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines.
Discret. Appl. Math., 2014
Springer, ISBN: 978-3-642-41879-2, 2014
2013
IEEE Trans. Smart Grid, 2013
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013
2012
Eur. J. Oper. Res., 2012
Scheduling Two Chains on Parallel Dedicated Machines.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
2010
2009
A Lagrangian approach to single-machine scheduling problems with two competing agents.
J. Sched., 2009
Oper. Res. Lett., 2009
INFORMS J. Comput., 2009
2007
2006
2005
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems.
J. Sched., 2005
Math. Program., 2005
2004
A heuristic approach to batching and scheduling a single machine to minimize setup costs.
Comput. Ind. Eng., 2004
2003
J. Sched., 2003
2001
A linear algorithm for the Hamiltonian completion number of the line graph of a tree.
Inf. Process. Lett., 2001
2000
Eur. J. Oper. Res., 2000
Comput. Math. Organ. Theory, 2000
1997
Discret. Appl. Math., 1997
Concurrent operations assignment and sequencing for particular assembly problems in flow lines.
Ann. Oper. Res., 1997
1995
IEEE Trans. Robotics Autom., 1995
1992
Proceedings of the 1992 IEEE International Conference on Robotics and Automation, 1992
1991
Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991
1990
Flexibility/Cost Tradeoff in the Design of Production Systems: a Preliminary Approach.
Proceedings of the Modelling the Innovation: Communications, 1990