Sciweavers

19 search results - page 2 / 4
» Scheduling optimization through iterative refinement
Sort
View
SPAA
1993
ACM
13 years 9 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
ICC
2008
IEEE
13 years 11 months ago
Normal Graphs for Downlink Multiuser MIMO Scheduling
—Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-...
Jung-Chieh Chen, Cheng-Hsuan Wu, Chao-Kai Wen, Yao...
WSC
2001
13 years 6 months ago
Distributed simulation with incorporated APS procedures for high-fidelity supply chain optimization
Tactical and operational planning for manufacturing enterprises are more important today than ever before as their supply chains span the globe. Two state-of-the-art technologies ...
Peter Lendermann, Boon-Ping Gan, Leon F. McGinnis
ANOR
2008
171views more  ANOR 2008»
13 years 5 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
INFOCOM
2008
IEEE
13 years 11 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff