 |
Optimistic bilevel scheduling with job selection on a single machine and maximum lateness minimization
1 : T'kindt
Université François Rabelais - Tours
2 : Università degli Studi di Siena = University of Siena
3 : Department of Management and Production Engineering [Politecnico di Torino]
In this paper we focus on a class of scheduling problems where two agents are concerned by the scheduling of a set of n jobs. The first agent, called the leader, first select jobs that are given to the second agent, called the follower, who next schedules them. This setting falls into the category of bilevel optimization.
