In:
The ANZIAM Journal, Cambridge University Press (CUP), Vol. 58, No. 3-4 ( 2017-04), p. 314-323
Abstract:
We study a nonpreemptive scheduling on two parallel identical machines with a dedicated loading server and a dedicated unloading server. Each job has to be loaded by the loading server before being processed on one of the machines and unloaded immediately by the unloading server after its processing. The loading and unloading times are both equal to one unit of time. The goal is to minimize the makespan. Since the problem is NP-hard, we apply the classical list scheduling and largest processing time heuristics, and show that they have worst-case ratios, $8/5$ and $6/5$ , respectively.
Type of Medium:
Online Resource
ISSN:
1446-1811
,
1446-8735
DOI:
10.1017/S1446181117000141
Language:
English
Publisher:
Cambridge University Press (CUP)
Publication Date:
2017
detail.hit.zdb_id:
2008847-4
Permalink