\input zb-basic
\input zb-ioport
\iteman{io-port 06090580}
\itemau{Chen, Rongjun; Tang, Guochun}
\itemti{Approximation algorithms of logistics scheduling under parallel machines.}
\itemso{Acta Math. Appl. Sin. 34, No. 6, 1046-1055 (2011).}
\itemab
Summary: In this paper, we study a general two-stage scheduling problem, in which jobs of different importance are processed by parallel machines at the first stage and then, in the second stage, the completed jobs need to be batch delivered to various pre-specified destinations in one of a number of available transportation modes. Our objective is to minimize the sum of weighted job delivery times and total transportation cost. For the problem under agreeable and general cases, we use dynamic programming and combinatorial method to provide heuristic algorithms with worst-case performance analysis, respectively.
\itemrv{~}
\itemcc{}
\itemut{scheduling; parallel machine; batching transportation; approximation algorithm}
\itemli{}
\end