| Article ID: | iaor20172806 |
| Volume: | 68 |
| Issue: | 4 |
| Start Page Number: | 799 |
| End Page Number: | 814 |
| Publication Date: | Aug 2017 |
| Journal: | Journal of Global Optimization |
| Authors: | Rudek Radoslaw |
| Keywords: | scheduling, manufacturing industries, combinatorial optimization, optimization, programming: dynamic, heuristics |
In this paper, we analyse the parallel machine makespan minimization problem with the general sum of processing time based learning or aging effects. First, we prove that an optimal solution to the single machine case can be found by priority rules. Next, for the considered parallel machine problem, we construct the exact dynamic programming algorithm that can operate on real‐valued job processing times, which is the only exact algorithm for the analysed problem. The computational analysis confirms that it can solve optimally moderate problem instances.