Solving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizes the maximum completion time (i.e., makespan or

کلیدواژه ها:

Teaching–learning Based Optimization ، Unrelated Parallel Machines ، Makespan ، Tardiness ، ، Earliness