Article ID: | iaor2013251 |
Volume: | 7 |
Issue: | 1 |
Start Page Number: | 39 |
End Page Number: | 50 |
Publication Date: | Jan 2013 |
Journal: | Optimization Letters |
Authors: | Oron Daniel, Kim Eun-Seok |
Keywords: | combinatorial optimization, scheduling |
We study two parallel machine scheduling problems with equal processing time jobs and delivery times and costs. The jobs are processed on machines which are located at different sites, and delivered to a customer by a single vehicle. The first objective considered is minimizing the sum of total weighted completion time and total vehicle delivery costs. The second objective considered is minimizing the sum of total tardiness and total vehicle delivery costs. We develop several interesting properties of an optimal scheduling and delivery policy, and show that both problems can be solved by reduction to the