default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Agnetis
Person information
- affiliation: University of Siena, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j54]Vincent T'kindt
, Federico Della Croce, Alessandro Agnetis:
Single machine adversarial bilevel scheduling problems. Eur. J. Oper. Res. 315(1): 63-72 (2024)- 2023
- [j53]Alessandro Agnetis, Matteo Cosmi, Gaia Nicosia, Andrea Pacifici:
Two is better than one? Order aggregation in a meal delivery scheduling problem. Comput. Ind. Eng. 183: 109514 (2023) - [j52]Alessandro Agnetis, Marco Pranzo:
Sequencing two classes of jobs on a machine with an external no-idle constraint. Int. J. Prod. Res. 61(7): 2178-2189 (2023) - 2022
- [j51]Monica Gentili, Pitu B. Mirchandani, Alessandro Agnetis, Zabih Ghelichi:
Locating platforms and scheduling a fleet of drones for emergency delivery of perishable items. Comput. Ind. Eng. 168: 108057 (2022) - [j50]Alessandro Agnetis, Mario Benini, Paolo Detti, Ben Hermans, Marco Pranzo:
Replication and sequencing of unreliable jobs on parallel machines. Comput. Oper. Res. 139: 105634 (2022) - [j49]Alessandro Agnetis, Ben Hermans, Roel Leus, Salim Rostami:
Time-critical testing and search problems. Eur. J. Oper. Res. 296(2): 440-452 (2022) - [j48]Quentin Fabry, Alessandro Agnetis, Lotte Berghman, Cyril Briand:
Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations. Oper. Res. Lett. 50(1): 50-56 (2022) - [c9]Alessandro Agnetis, Mario Benini, Paolo Detti, Marco Pranzo, Ben Hermans:
Replication and sequencing of unreliable jobs on parallel machines. ISAIM 2022 - 2021
- [j47]Premysl Sucha, Alessandro Agnetis, Marko Sidlovský, Cyril Briand:
Nash equilibrium solutions in multi-agent project scheduling with milestones. Eur. J. Oper. Res. 294(1): 29-41 (2021) - [i3]Alessandro Agnetis, Ben Hermans, Roel Leus, Salim Rostami:
Time-critical testing and search problems. CoRR abs/2101.05473 (2021) - 2020
- [j46]Alessandro Agnetis, Cyril Briand, Sandra Ulrich Ngueveu, Premysl Sucha:
Price of anarchy and price of stability in multi-agent project scheduling. Ann. Oper. Res. 285(1): 97-119 (2020) - [j45]Alessandro Agnetis, Thomas Lidbetter:
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. Oper. Res. Lett. 48(4): 405-409 (2020) - [j44]Alessandro Agnetis, Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov:
Editorial: Dynamic Scheduling Problems. J. Sched. 23(6): 629-630 (2020)
2010 – 2019
- 2019
- [j43]Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio:
Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks. Algorithms 12(12): 250 (2019) - [j42]Alessandro Agnetis, Bo Chen, Gaia Nicosia, Andrea Pacifici:
Price of fairness in two-agent single-machine scheduling problems. Eur. J. Oper. Res. 276(1): 79-87 (2019) - 2017
- [j41]Alessandro Agnetis, Paolo Detti, Patrick Martineau:
Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions. Comput. Oper. Res. 79: 109-118 (2017) - [j40]Alessandro Agnetis, Mohamed Ali Aloulou, Mikhail Y. Kovalyov:
Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. Int. J. Prod. Res. 55(20): 6193-6206 (2017) - [j39]Nadia Chaabane Fakhfakh, Cyril Briand, Marie-José Huguet, Alessandro Agnetis:
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game. Networks 69(1): 94-109 (2017) - [j38]Alessandro Agnetis, Gur Mosheiov:
Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim. Lett. 11(4): 885-892 (2017) - [j37]Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut:
Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence. J. Sched. 20(6): 681-693 (2017) - 2016
- [c8]Azeddine Cheref, Alessandro Agnetis, Christian Artigues, Jean-Charles Billaut:
Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems. ICORES 2016: 145-151 - 2015
- [j36]Alessandro Agnetis, Mohamed Ali Aloulou, Liang-Liang Fu, Mikhail Y. Kovalyov:
Two faster algorithms for coordination of production and batch delivery: A note. Eur. J. Oper. Res. 241(3): 927-930 (2015) - [j35]Alessandro Agnetis, Cyril Briand, Jean-Charles Billaut, Premysl Sucha:
Nash equilibria for the multi-agent project scheduling problem with controllable processing times. J. Sched. 18(1): 15-27 (2015) - [j34]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3): 243-261 (2015) - 2014
- [b1]Alessandro Agnetis, Jean-Charles Billaut, Stanislaw Gawiejnowicz, Dario Pacciarelli, Ameur Soukhal:
Multiagent Scheduling - Models and Algorithms. Springer 2014, ISBN 978-3-642-41879-2, pp. I-XIII, 1-271 - [j33]Alessandro Agnetis, Paolo Detti, Marco Pranzo:
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines. Discret. Appl. Math. 165: 2-11 (2014) - [j32]Alessandro Agnetis, Mohamed Ali Aloulou, Liang-Liang Fu:
Coordination of production and interstage batch delivery with outsourced distribution. Eur. J. Oper. Res. 238(1): 130-142 (2014) - 2013
- [j31]Alessandro Agnetis, Vito Fragnelli:
Some Nonstandard Features of bargaining Problems. IGTR 15(2) (2013) - [j30]Alessandro Agnetis, Gianluca de Pascale, Paolo Detti, Antonio Vicino:
Load Scheduling for Household Energy Consumption Optimization. IEEE Trans. Smart Grid 4(4): 2364-2373 (2013) - [c7]Alessandro Agnetis, Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy:
Two Agents Competing for a Shared Machine. ADT 2013: 1-14 - 2012
- [j29]Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici:
Parallel dedicated machines scheduling with chain precedence constraints. Eur. J. Oper. Res. 221(2): 296-305 (2012) - [j28]Alessandro Agnetis, Enrico Grande, Andrea Pacifici:
Demand allocation with latency cost functions. Math. Program. 132(1-2): 277-294 (2012) - [c6]Alessandro Agnetis, Hans Kellerer, Gaia Nicosia, Andrea Pacifici:
Scheduling Two Chains on Parallel Dedicated Machines. CTW 2012: 9-12 - 2011
- [j27]Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici:
A job-shop problem with one additional resource type. J. Sched. 14(3): 225-237 (2011) - [c5]Alessandro Agnetis, Gabriella Dellino, Paolo Detti, Giacomo Innocenti, Gianluca de Pascale, Antonio Vicino:
Appliance operation scheduling for electricity consumption optimization. CDC/ECC 2011: 5899-5904 - [c4]Alessandro Agnetis, Paolo Detti, Patrick Martineau:
Scheduling problems with unreliable jobs and machines. CTW 2011: 32-35 - 2010
- [j26]Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici:
Scheduling three chains on two parallel machines. Eur. J. Oper. Res. 202(3): 669-674 (2010)
2000 – 2009
- 2009
- [j25]Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea Pacifici:
Covering a line segment with variable radius discs. Comput. Oper. Res. 36(5): 1423-1436 (2009) - [j24]Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
Single-Machine Scheduling Problems with Generalized Preemption. INFORMS J. Comput. 21(1): 1-12 (2009) - [j23]Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti:
Optimal packet-to-slot assignment in mobile telecommunications. Oper. Res. Lett. 37(4): 261-264 (2009) - [j22]Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir Singh Sodhi:
Sequencing unreliable jobs on parallel machines. J. Sched. 12(1): 45-54 (2009) - [j21]Alessandro Agnetis, Gianluca de Pascale, Dario Pacciarelli:
A Lagrangian approach to single-machine scheduling problems with two competing agents. J. Sched. 12(4): 401-415 (2009) - 2008
- [i2]Alessandro Agnetis, Enrico Grande, Andrea Pacifici:
Demand allocation with latency cost functions. CoRR abs/0810.1650 (2008) - 2007
- [j20]Alessandro Agnetis, Dario Pacciarelli, Andrea Pacifici:
Multi-agent single machine scheduling. Ann. Oper. Res. 150(1): 3-15 (2007) - [i1]Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea Pacifici:
Covering a line segment with variable radius discs. CoRR abs/0707.2921 (2007) - 2006
- [j19]Alessandro Agnetis, Nicholas G. Hall, Dario Pacciarelli:
Supply chain scheduling: Sequence coordination. Discret. Appl. Math. 154(15): 2044-2063 (2006) - 2005
- [j18]Carlo Filippi, Alessandro Agnetis:
An asymptotically exact algorithm for the high-multiplicity bin packing problem. Math. Program. 104(1): 21-37 (2005) - [j17]Paolo Detti, Alessandro Agnetis, Gianfranco Ciaschetti:
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. J. Sched. 8(3): 255-273 (2005) - 2004
- [j16]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) - [j15]Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli, Andrea Pacifici:
Scheduling Problems with Two Competing Agents. Oper. Res. 52(2): 229-242 (2004) - [j14]Alessandro Agnetis, Fabrizio Rossi, Stefano Smriglio:
An implicit enumeration scheme for the batch selection problem. Networks 44(2): 151-159 (2004) - 2003
- [j13]Alessandro Agnetis, Paolo Detti, Carlo Meloni:
Process selection and sequencing in a two-agents production system. 4OR 1(2): 103-119 (2003) - [j12]Alessandro Agnetis, Gianpaolo Brogi, Gianfranco Ciaschetti, Paolo Detti, Giovanni Giambene:
Optimal packet scheduling in UTRA-TDD. IEEE Commun. Lett. 7(3): 112-114 (2003) - [j11]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) - 2001
- [j10]Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli:
Set-Up Coordination between Two Stages of a Supply Chain. Ann. Oper. Res. 107(1-4): 15-32 (2001) - [j9]Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli:
A linear algorithm for the Hamiltonian completion number of the line graph of a tree. Inf. Process. Lett. 79(1): 17-24 (2001) - 2000
- [j8]Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli, Andrea Pacifici:
Nondominated Schedules for a Job-Shop with Two Competing Users. Comput. Math. Organ. Theory 6(2): 191-217 (2000) - [j7]Alessandro Agnetis:
Scheduling no-wait robotic cells with two and three machines. Eur. J. Oper. Res. 123(2): 303-314 (2000) - [j6]Alessandro Agnetis, Dario Pacciarelli:
Part sequencing in three-machine no-wait robotic cells. Oper. Res. Lett. 27(4): 185-192 (2000)
1990 – 1999
- 1997
- [j5]Alessandro Agnetis, Claudio Arbib:
Concurrent operations assignment and sequencing for particular assembly problems in flow lines. Ann. Oper. Res. 69: 1-31 (1997) - [j4]Alessandro Agnetis:
No-wait flow shop scheduling with large lot sizes. Ann. Oper. Res. 70: 415-438 (1997) - [j3]Alessandro Agnetis, Dario Pacciarelli, Fabrizio Rossi:
Batch Scheduling in a Two-machine Flow Shop with Limited Buffer. Discret. Appl. Math. 72(3): 243-260 (1997) - 1995
- [j2]Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini:
Task assignment and subassembly scheduling in flexible assembly lines. IEEE Trans. Robotics Autom. 11(1): 1-20 (1995) - 1992
- [c3]Alessandro Agnetis, Fernando Nicolò, Claudio Arbib, Mario Lucertini:
Task assignment in pipeline assembly systems. ICRA 1992: 1133-1138 - 1991
- [c2]Alessandro Agnetis, Fernando Nicolò, Mario Lucertini:
Tool handling synchronization in flexible manufacturing cells. ICRA 1991: 1789-1794 - 1990
- [j1]Alessandro Agnetis, Claudio Arbib, Mario Lucertini, Fernando Nicolò:
Part routing in flexible assembly systems. IEEE Trans. Robotics Autom. 6(6): 697-705 (1990) - [c1]Alessandro Agnetis, Fernando Nicolò, Mario Lucertini:
Flexibility/Cost Tradeoff in the Design of Production Systems: a Preliminary Approach. Modelling the Innovation 1990: 247-258
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-01-20 22:58 CET 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:
