Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps.

Avital Lann Gur Mosheiov Yosef Rinott

Published in: Oper. Res. Lett. (1998)

Keyphrases

asymptotic optimality
scheduling problem
flowshop
asymptotically optimal
sufficient conditions
probability distribution
processing times
single machine
shortest processing time
decision making
intelligent agents
ant colony optimization
precedence constraints
single machine scheduling problem