A parallel machine scheduling problem with job splitting and learning is proposed.
A branch-and-bound algorithm is proposed to solve small sized problems.
Several heuristics are proposed to solve the large-sized problems.
The greedy search which utilizes analytical property outperforms other heuristics.