Minimizing makespan of personal scheduling problem in available time -windows with split min and setup time constraints

This paper deals with personal scheduling problem in available time-windows with splitmin and setup-time constraints. The jobs are splittable into sub-jobs and a common lower bound on the size of each sub-job is imposed. The objective function aims to find a feasible schedule that minimizes the total completion time of all jobs.