#### Filter Results:

- Full text PDF available (21)

#### Publication Year

1990

2017

- This year (3)
- Last 5 years (21)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli, Andrea Pacifici
- Operations Research
- 2004

- Alessandro Agnetis
- European Journal of Operational Research
- 2000

- Alessandro Agnetis, Dario Pacciarelli, Andrea Pacifici
- Annals OR
- 2007

We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular… (More)

- Alessandro Agnetis, Dario Pacciarelli
- Oper. Res. Lett.
- 2000

A no-wait robotic cell is an automated ow shop in which a robot is used to move the parts from a machine to the next. Parts are not allowed to wait. We analyze the complexity of the part sequencing problem in a robotic cell with three machines, for di erent periodical patterns of robot moves, when the objective is productivity maximization. c © 2000… (More)

- Alessandro Agnetis, Marta Flamini, Gaia Nicosia, Andrea Pacifici
- J. Scheduling
- 2011

We consider a job shop scheduling problem with n jobs and the constraint that at most p < n jobs can be processed simultaneously. This model arises in several manufacturing processes, where each operation has to be assisted by one human operator and there are p (versatile) operators. The problem is binary NP-hard even with n = 3 and p = 2. When the number… (More)

- Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli
- Annals OR
- 2001

- Alessandro Agnetis, Nicholas G. Hall, Dario Pacciarelli
- Discrete Applied Mathematics
- 2006

A critical issue in supply chain management is coordinating the decisions made by decisionmakers at different stages, for example a supplier and one or several manufacturers. We model this issue by assuming that both the supplier and each manufacturer have an ideal schedule, determined by their own costs and constraints. An interchange cost is incurred by… (More)

- Alessandro Agnetis, Paolo Detti, Carlo Meloni, Dario Pacciarelli
- Inf. Process. Lett.
- 2001

Given a graph G= (V ,E), HCN(L(G)) is the minimum number of edges to be added to its line graph L(G) to make L(G) Hamiltonian. This problem is known to be NP-hard for general graphs, whereas an O(|V |5) algorithm exists when G is a tree. In this paper a linear algorithm for finding HCN(L(G)) when G is a tree is proposed. 2001 Elsevier Science B.V. All… (More)

- Alessandro Agnetis, Pitu B. Mirchandani, Dario Pacciarelli, Andrea Pacifici
- Computational & Mathematical Organization Theory
- 2000

- Alessandro Agnetis, Paolo Detti, Marco Pranzo, Manbir S. Sodhi
- J. Scheduling
- 2009