Transporting jobs through a processing center with two parallel machines

Authors:
Hans Kellerer;Alan J. Soper;Vitaly A. Strusevich
Affiliations:
Institut für Statistik und Operations Research, Universität Graz, Graz, Austria;School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London, UK;School of Computing and Mathematical Sciences, University of Greenwich, Old Royal Naval College, Greenwich, London, UK
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Year:
2010

Citing 4
Cited 1

A heuristic for two-machine open-shop scheduling problem with transportation times

Discrete Applied Mathematics
Makespan minimization for flow-shop problems with transportation times and a single robot

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
An efficient fully polynomial approximation scheme for the Subset-Sum problem

Journal of Computer and System Sciences
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling

Preemptive scheduling on two identical parallel machines with a single transporter

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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).