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

Yiwei Jiang (), Huijuan Wang () and Ping Zhou ()
Additional contact information
Yiwei Jiang: Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou 310018, P. R. China
Huijuan Wang: School of Economics and Management, Zhejiang Sci-Tech University, Hangzhou 310018, P. R. China
Ping Zhou: School of Humanities, Zhejiang Business College, Hangzhou 310053, P. R. China

Asia-Pacific Journal of Operational Research (APJOR), 2014, vol. 31, issue 05, 1-11

Abstract: 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.

Keywords: Preemptive scheduling; server; algorithm; makespan (search for similar items in EconPapers)
Date: 2014
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0217595914500390
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:apjorx:v:31:y:2014:i:05:n:s0217595914500390

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0217595914500390

Access Statistics for this article

Asia-Pacific Journal of Operational Research (APJOR) is currently edited by Gongyun Zhao

More articles in Asia-Pacific Journal of Operational Research (APJOR) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().