Login / Signup
An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times.
José Elías C. Arroyo
Joseph Y.-T. Leung
Published in:
Comput. Ind. Eng. (2017)
Keyphrases
</>
greedy algorithm
identical machines
iterated greedy
greedy algorithms
parallel machines
worst case
greedy heuristic
dynamic programming
parallel processors
influence maximization
set cover
greedy strategy
objective function
shared memory
wafer fabrication
setup times
batch processing
single machine