No-wait scheduling in single-hop multi-channel LANs

Authors:
Fengfeng Zhou;Yinlong Xu;Guoliang Chen
Affiliations:
National High Performance Computing Center at Hefei, Department of Computer Science, University of Science and Technology of China, Anhui, Hefei, 230027, P.R. China;National High Performance Computing Center at Hefei, Department of Computer Science, University of Science and Technology of China, Anhui, Hefei, 230027, P.R. China;National High Performance Computing Center at Hefei, Department of Computer Science, University of Science and Technology of China, Anhui, Hefei, 230027, P.R. China
Venue:
Information Processing Letters
Year:
2005

Citing 4
Cited 0

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Scheduling variable-length messages in a single-hop multichannel local lightwave network

IEEE/ACM Transactions on Networking (TON)
An experimental study of online scheduling algorithms

Journal of Experimental Algorithmics (JEA)
A bandwidth allocation/sharing/extension protocol for multimedia over IEEE 802.11 ad hoc wireless LANs

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.89

Visualization

Abstract

An extended version of the multiprocessor machine scheduling problem with makespan objective, which arises from single-hop multi-channel LANs, is presented in this paper. In this scheduling model, each job consists of two operations, and each operation may be processed by anyone of a given set of machines, while in the job shop scheduling problem, such a set contains only one machine. For this NP-complete problem, we first analyze the performance ratios of two simple strategies, List Scheduling and Longest Processing Time First, for the off-line cases, which have performance ratios (5/2 - 1/2m) and (2 + 1/2(m + 1)), respectively, with (m + 1) being the number of the machines. We also show that the competitive ratio of the List Scheduling strategy for the on-line cases is (7/2 - 1/2m).