New Results on the Coordination of Transportation and Batching Scheduling

We study a coordinated scheduling problem of production and transportation, where a set of jobs needs to be transported from a holding area to a single batch machine for further processing. A number of results for this combined transportation and scheduling environment have recently been published, looking into the complexity status of the minimization of the sum of total processing time and processing cost, and of the sum of makespan and processing cost, for a fixed number of transporters. In this paper, we add to these results in that (1) we show that the earlier complexity results are still valid when the processing cost is removed from the objective, thus reducing to more “classic” scheduling objectives; (2) we assess the complexity status of the relevant problem variants with free number of transporters; (3) we prove that the weighted-completion-time objective leads to an intractable problem even with a single transporter, contrary to the unweighted case. We also establish a link with the so-called serial batching problem