List scheduling

Greedy algorithm

List scheduling is a greedy algorithm for Identical-machines scheduling. The input to this algorithm is a list of jobs that should be executed on a set of m machines. The list is ordered in a fixed order, which can be determined e.g. by the priority of executing the jobs, or by their order of arrival. The algorithm repeatedly executes the following steps until a valid schedule is obtained:Take the first job in the list. Find a machine that is available for executing this job. If a machine is found, schedule this job on that machine. Otherwise, select the next job in the list.

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