Scheduling with two competing agents to minimize total weighted earliness.

Enrique Gerstl Baruch Mor Gur Mosheiov

Published in: Ann. Oper. Res. (2017)

Keyphrases

minimize total
single machine
parallel machines
scheduling problem
release dates
weighted tardiness
processing times
sequence dependent setup times
setup times
precedence constraints
single machine scheduling problem
dynamic programming
total cost
tabu search
resource allocation
parallel computing