A Lagrangian approach to single-machine scheduling problems with two competing agents.

Alessandro Agnetis Gianluca de Pascale Dario Pacciarelli

Published in: J. Sched. (2009)

Keyphrases

single machine scheduling problem
multi agent systems
multi agent
lagrangian relaxation
prize collecting
branch and bound algorithm
precedence constraints
processing times
optimal solution
resource allocation
release times
lower bound
dynamic programming
metaheuristic
combinatorial optimization
feasible solution