An Optimal Preemptive Algorithm for the Single-Server Parallel-Machine Scheduling with Loading and Unloading Times

We study a preemptive scheduling problem on two identical parallel machines that share a common server. Each job has to be loaded by the server before being processed on one of the machines and unloaded by the server after its processing. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O(n log n) solution algorithm for the preemptive variant of the problem.

MoreLess

Year of publication:	2014
Authors:	Jiang, Yiwei ; Wang, Huijuan ; Zhou, Ping
Published in:	Asia-Pacific Journal of Operational Research (APJOR). - World Scientific Publishing Co. Pte. Ltd., ISSN 1793-7019. - Vol. 31.2014, 05, p. 1450039-1
Publisher:	World Scientific Publishing Co. Pte. Ltd.
Subject:	Preemptive scheduling \| server \| algorithm \| makespan

More details

Extent:	application/pdf text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010940521