Flexibility/Cost Tradeoff in the Design of Production Systems: a Preliminary Approach. - Alessandro Agnetis; Fernando Nicolò; Mario Lucertini (Modelling the Innovation, 1990)

Part routing in flexible assembly systems. - Alessandro Agnetis; Claudio Arbib; Mario Lucertini; Fernando Nicolò (IEEE Trans. Robotics Autom., 1990)

Tool handling synchronization in flexible manufacturing cells. - Alessandro Agnetis; Fernando Nicolò; Mario Lucertini (ICRA, 1991)

Task assignment in pipeline assembly systems. - Alessandro Agnetis; Fernando Nicolò; Claudio Arbib; Mario Lucertini (ICRA, 1992)

Task assignment and subassembly scheduling in flexible assembly lines. - Alessandro Agnetis; Fernando Nicolò; Claudio Arbib; Mario Lucertini (IEEE Trans. Robotics Autom., 1995)

No-wait flow shop scheduling with large lot sizes. - Alessandro Agnetis (Ann. Oper. Res., 1997)

Concurrent operations assignment and sequencing for particular assembly problems in flow lines. - Alessandro Agnetis; Claudio Arbib (Ann. Oper. Res., 1997)

Batch Scheduling in a Two-machine Flow Shop with Limited Buffer. - Alessandro Agnetis; Dario Pacciarelli; Fabrizio Rossi (Discret. Appl. Math., 1997)

Nondominated Schedules for a Job-Shop with Two Competing Users. - Alessandro Agnetis; Pitu B. Mirchandani; Dario Pacciarelli; Andrea Pacifici (Comput. Math. Organ. Theory, 2000)

Scheduling no-wait robotic cells with two and three machines. - Alessandro Agnetis (Eur. J. Oper. Res., 2000)

Part sequencing in three-machine no-wait robotic cells. - Alessandro Agnetis; Dario Pacciarelli (Oper. Res. Lett., 2000)

Set-Up Coordination between Two Stages of a Supply Chain. - Alessandro Agnetis; Paolo Detti; Carlo Meloni; Dario Pacciarelli (Ann. Oper. Res., 2001)

A linear algorithm for the Hamiltonian completion number of the line graph of a tree. - Alessandro Agnetis; Paolo Detti; Carlo Meloni; Dario Pacciarelli (Inf. Process. Lett., 2001)

Process selection and sequencing in a two-agents production system. - Alessandro Agnetis; Paolo Detti; Carlo Meloni (4OR, 2003)

Optimal packet scheduling in UTRA-TDD. - Alessandro Agnetis; Gianpaolo Brogi; Gianfranco Ciaschetti; Paolo Detti; Giovanni Giambene (IEEE Commun. Lett., 2003)

Part Batching and Scheduling in a Flexible Cell to Minimize Setup Costs. - Alessandro Agnetis; Arianna Alfieri; Gaia Nicosia (J. Sched., 2003)

A heuristic approach to batching and scheduling a single machine to minimize setup costs. - Alessandro Agnetis; Arianna Alfieri; Gaia Nicosia (Comput. Ind. Eng., 2004)

Scheduling Problems with Two Competing Agents. - Alessandro Agnetis; Pitu B. Mirchandani; Dario Pacciarelli; Andrea Pacifici (Oper. Res., 2004)

An implicit enumeration scheme for the batch selection problem. - Alessandro Agnetis; Fabrizio Rossi; Stefano Smriglio (Networks, 2004)

An asymptotically exact algorithm for the high-multiplicity bin packing problem. - Carlo Filippi; Alessandro Agnetis (Math. Program., 2005)

Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems. - Paolo Detti; Alessandro Agnetis; Gianfranco Ciaschetti (J. Sched., 2005)

Supply chain scheduling: Sequence coordination. - Alessandro Agnetis; Nicholas G. Hall; Dario Pacciarelli (Discret. Appl. Math., 2006)

Multi-agent single machine scheduling. - Alessandro Agnetis; Dario Pacciarelli; Andrea Pacifici (Ann. Oper. Res., 2007)

Covering a line segment with variable radius discs. - Alessandro Agnetis; Enrico Grande; Pitu B. Mirchandani; Andrea Pacifici (Comput. Oper. Res., 2009)

Single-Machine Scheduling Problems with Generalized Preemption. - Alessandro Agnetis; Arianna Alfieri; Gaia Nicosia (INFORMS J. Comput., 2009)

Optimal packet-to-slot assignment in mobile telecommunications. - Paolo Detti; Cor A. J. Hurkens; Alessandro Agnetis; Gianfranco Ciaschetti (Oper. Res. Lett., 2009)

Sequencing unreliable jobs on parallel machines. - Alessandro Agnetis; Paolo Detti; Marco Pranzo; Manbir Singh Sodhi (J. Sched., 2009)

A Lagrangian approach to single-machine scheduling problems with two competing agents. - Alessandro Agnetis; Gianluca de Pascale; Dario Pacciarelli (J. Sched., 2009)

Scheduling three chains on two parallel machines. - Alessandro Agnetis; Marta Flamini; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2010)

Appliance operation scheduling for electricity consumption optimization. - Alessandro Agnetis; Gabriella Dellino; Paolo Detti; Giacomo Innocenti; Gianluca de Pascale; Antonio Vicino (CDC/ECC, 2011)

Scheduling problems with unreliable jobs and machines. - Alessandro Agnetis; Paolo Detti; Patrick Martineau (CTW, 2011)

A job-shop problem with one additional resource type. - Alessandro Agnetis; Marta Flamini; Gaia Nicosia; Andrea Pacifici (J. Sched., 2011)

Scheduling Two Chains on Parallel Dedicated Machines. - Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici (CTW, 2012)

Parallel dedicated machines scheduling with chain precedence constraints. - Alessandro Agnetis; Hans Kellerer; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2012)

Demand allocation with latency cost functions. - Alessandro Agnetis; Enrico Grande; Andrea Pacifici (Math. Program., 2012)

Two Agents Competing for a Shared Machine. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (ADT, 2013)

Some Nonstandard Features of bargaining Problems. - Alessandro Agnetis; Vito Fragnelli (IGTR, 2013)

Load Scheduling for Household Energy Consumption Optimization. - Alessandro Agnetis; Gianluca de Pascale; Paolo Detti; Antonio Vicino (IEEE Trans. Smart Grid, 2013)

Multiagent Scheduling - Models and Algorithms. - Alessandro Agnetis; Jean-Charles Billaut; Stanislaw Gawiejnowicz; Dario Pacciarelli; Ameur Soukhal (Springer, 2014)

The list scheduling algorithm for scheduling unreliable jobs on two parallel machines. - Alessandro Agnetis; Paolo Detti; Marco Pranzo (Discret. Appl. Math., 2014)

Coordination of production and interstage batch delivery with outsourced distribution. - Alessandro Agnetis; Mohamed Ali Aloulou; Liang-Liang Fu (Eur. J. Oper. Res., 2014)

Two faster algorithms for coordination of production and batch delivery: A note. - Alessandro Agnetis; Mohamed Ali Aloulou; Liang-Liang Fu; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2015)

Nash equilibria for the multi-agent project scheduling problem with controllable processing times. - Alessandro Agnetis; Cyril Briand; Jean-Charles Billaut; Premysl Sucha (J. Sched., 2015)

Scheduling two agent task chains with a central selection mechanism. - Alessandro Agnetis; Gaia Nicosia; Andrea Pacifici; Ulrich Pferschy (J. Sched., 2015)

Fixed-sequence Single Machine Scheduling and Outbound Delivery Problems. - Azeddine Cheref; Alessandro Agnetis; Christian Artigues; Jean-Charles Billaut (ICORES, 2016)

Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions. - Alessandro Agnetis; Paolo Detti; Patrick Martineau (Comput. Oper. Res., 2017)

Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. - Alessandro Agnetis; Mohamed Ali Aloulou; Mikhail Y. Kovalyov (Int. J. Prod. Res., 2017)

Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game. - Nadia Chaabane Fakhfakh; Cyril Briand; Marie-José Huguet; Alessandro Agnetis (Networks, 2017)

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. - Alessandro Agnetis; Gur Mosheiov (Optim. Lett., 2017)

Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence. - Azeddine Cheref; Alessandro Agnetis; Christian Artigues; Jean-Charles Billaut (J. Sched., 2017)

Some Results on Shop Scheduling with S-Precedence Constraints among Job Tasks. - Alessandro Agnetis; Fabrizio Rossi; Stefano Smriglio (Algorithms, 2019)

Price of fairness in two-agent single-machine scheduling problems. - Alessandro Agnetis; Bo Chen 002; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2019)

Price of anarchy and price of stability in multi-agent project scheduling. - Alessandro Agnetis; Cyril Briand; Sandra Ulrich Ngueveu; Premysl Sucha (Ann. Oper. Res., 2020)

The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. - Alessandro Agnetis; Thomas Lidbetter (Oper. Res. Lett., 2020)

Editorial: Dynamic Scheduling Problems. - Alessandro Agnetis; Stanislaw Gawiejnowicz; Bertrand Miao-Tsong Lin; Gur Mosheiov (J. Sched., 2020)

Nash equilibrium solutions in multi-agent project scheduling with milestones. - Premysl Sucha; Alessandro Agnetis; Marko Sidlovský; Cyril Briand (Eur. J. Oper. Res., 2021)

Locating platforms and scheduling a fleet of drones for emergency delivery of perishable items. - Monica Gentili; Pitu B. Mirchandani; Alessandro Agnetis; Zabih Ghelichi (Comput. Ind. Eng., 2022)

Replication and sequencing of unreliable jobs on parallel machines. - Alessandro Agnetis; Mario Benini; Paolo Detti; Ben Hermans; Marco Pranzo (Comput. Oper. Res., 2022)

Time-critical testing and search problems. - Alessandro Agnetis; Ben Hermans; Roel Leus; Salim Rostami (Eur. J. Oper. Res., 2022)

Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations. - Quentin Fabry; Alessandro Agnetis; Lotte Berghman; Cyril Briand (Oper. Res. Lett., 2022)

Sequencing two classes of jobs on a machine with an external no-idle constraint. - Alessandro Agnetis; Marco Pranzo (Int. J. Prod. Res., 2023)

Two is better than one? Order aggregation in a meal delivery scheduling problem. - Alessandro Agnetis; Matteo Cosmi; Gaia Nicosia; Andrea Pacifici (Comput. Ind. Eng., 2023)

Single machine adversarial bilevel scheduling problems. - Vincent T'kindt; Federico Della Croce; Alessandro Agnetis (Eur. J. Oper. Res., 2024)

Replication and sequencing of unreliable jobs on m parallel machines: New results. - Alessandro Agnetis; Mario Benini; Paolo Detti; Ben Hermans; Marco Pranzo; Kevin Schewior (Comput. Oper. Res., 2025)

Trade-off between utility and fairness in two-agent single-machine scheduling. - Alessandro Agnetis; Mario Benini; Gaia Nicosia; Andrea Pacifici (Eur. J. Oper. Res., 2025)