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. Lecture Notes in Computer Science, 6508. pp. 408-422. ISSN 0302-9743Full text not available from this repository.
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).
|Additional Information:|| Paper published in Lecture Notes in Computer Science Volume 6508, 2010, DOI: 10.1007/978-3-642-17458-2 - subtitled Combinatorial Optimization and Applications 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I.  Also allocated ISBN 978-3-642-17457-5.  ISSN: 0302-9743 (Print), 1611-3349 (Online)|
|Uncontrolled Keywords:||scheduling with transportation, parallel machines, FPTAS|
|Subjects:||Q Science > QA Mathematics|
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
|School / Department / Research Groups:||School of Computing & Mathematical Sciences|
School of Computing & Mathematical Sciences > Department of Computer Science
School of Computing & Mathematical Sciences > Department of Mathematical Sciences
|Last Modified:||05 Feb 2013 10:54|
Actions (login required)