Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans, Soper, Alan J. and Strusevich, Vitaly A. (2013) Preemptive scheduling on two identical parallel machines with a single transporter. Journal of Combinatorial Optimization, 25 (2). pp. 279-307. ISSN 1382-6905 (Print), 1573-2886 (Online) (doi:10.1007/s10878-012-9511-x)
|PDF (AAM) - Accepted Version |
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (513kB) | Preview
We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that either solves the problem to optimality or in the worst case behaves as a fully polynomial-time approximation scheme.
|Additional Information:|| This is the Authors’ Accepted Manuscript version. The final publication is available at Springer via http://dx.doi.org/10.1007/s10878-012-9511-x.|
|Uncontrolled Keywords:||scheduling with transportation, parallel machines, approximation scheme,|
|Subjects:||Q Science > QA Mathematics|
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
Faculty of Architecture, Computing & Humanities > School of Computing & Mathematical Sciences > Department of Mathematical Sciences
|Last Modified:||23 Sep 2014 01:38|
Actions (login required)