EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
2275. Balancing the average weighted completion times by network design
Invited abstract in session WD-60: Flow shop and single machine scheduling , stream Project Management and Scheduling.
Wednesday, 14:30-16:00Room: S09 (building: 101)
Authors (first author is the speaker)
| 1. | Antonio Fuduli
|
| Department of Mathematics and Computer Science, University of Calabria | |
| 2. | Matteo Avolio
|
| Department of Mathematics and Computer Science, University of Calabria |
Abstract
We face a single-machine NP-hard scheduling problem, whose objective is to balance the average weighted completion times of two different classes of jobs. Since both the job sets contribute to the same objective function, this problem can be interpreted as a cooperative two-agent scheduling problem, whereas the standard multiagent problems are of the competitive type since each class of job is involved only in optimizing its agent’s criterion. Balancing the average completion times of different sets of tasks finds application in many fields, such as in in services, for balancing the waiting times of groups of people, and in logistics for balancing the delivery times.
To solve this problem, we propose a Lagrangian relaxation approach based on a network flow formulation. A possible bi-criterion extension is also investigated, taking into account the additional objective aimed at minimizing the maximum between the two average weighted completion times. Preliminary numerical results are presented.
Keywords
- Scheduling
- Graphs and Networks
Status: accepted
Back to the list of papers