# Transporting jobs through a processing center with two parallel machines

Kellerer, Hans, Soper, Alan J. and Strusevich, Vitaly A.
(2010)
*Transporting jobs through a processing center with two parallel machines.*
In: Wu, Weili and Daescu, Ovidiu, (eds.)
Combinatorial Optimization and Applications: 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I.
Lecture Notes in Computer Science
(6508).
Springer Berlin Heidelberg, Berlin, Germany, pp. 408-422.
ISBN 978364274575
ISSN 0302-9743
(doi:10.1007/978-3-642-17458-2_33)

## Abstract

In this paper, we consider a processing system that consists of two identical parallel machines such that the jobs are delivered to the system by a single transporter and moved between the machines by the same transporter. The objective is to minimize the length of a schedule, i.e., the time by which the completed jobs are collected together on board the transporter. The jobs can be processed with preemption, provided that the portions of jobs are properly transported to the corresponding machines. We establish properties of feasible schedule, define lower bounds on the optimal length and describe an algorithm that behaves like a fully polynomial-time approximation scheme (FPTAS).

### Actions (login required)

View Item |