A subset-sum type formulation of a two-agent single-machine scheduling problem.

Matteo Avolio Antonio Fuduli

Published in: Inf. Process. Lett. (2020)

Keyphrases

single machine scheduling problem
completion times
weighted tardiness
branch and bound algorithm
processing times
release dates
single machine
objective function
scheduling problem
combinatorial optimization
reinforcement learning
search algorithm
special case
flowshop
precedence constraints
resource consumption