Keywords

#identical-machines_scheduling

Identical-machines scheduling

Identical-machines scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on m identical machines, such that a certain objective function is optimized, for example, the makespan is minimized.

Sat 16th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Identical-machines scheduling Unrelated-machines scheduling Optimal job scheduling Uniform-machines scheduling Job-shop scheduling Single-machine scheduling List scheduling Longest-processing-time-first scheduling Multiway number partitioning Interval scheduling
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.