Unrelated Parallel-Machine Scheduling Problems with General Truncated Job-Dependent Learning Effect

Abstract

In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m O n 2 ( ) + time respectively, where m is the number of machines and n is the number of jobs.