Preemptive scheduling on two identical parallel machines with a single transporter

Authors:
Hans Kellerer;Alan J. Soper;Vitaly A. Strusevich
Affiliations:
Institut für Statistik und Operations Research, Universität Graz, Graz, Austria 8010;School of Computing and Mathematical Sciences, Old Royal Naval College, University of Greenwich, London, UK SE10 9LS;School of Computing and Mathematical Sciences, Old Royal Naval College, University of Greenwich, London, UK SE10 9LS
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 5
Cited 0

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
Transporting jobs through a processing center with two parallel machines

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.