Benmansour, Rachid; Braun, Oliver - In: Central European Journal of Operations Research 31 (2022) 1, pp. 191-204
In the single-processor scheduling problem with time restrictions there is one main processor and B resources that are used to execute the jobs. A perfect schedule has no idle times or gaps on the main processor and the makespan is therefore equal to the sum of the processing times. In general,...
