Results 1 - 10 of 2,886

Stochastic Procedures for Generating Feasible Schedules

by Angelo Oddi, Stephen F. Smith - In Proceedings 14th National Conference on AI (AAAI-97 , 1997
"... In this paper, we investigate the use of stochastic variable and value ordering heuristics for solving job shop scheduling problems with non-relaxable deadlines and complex metric constraints. Previous research in constraint satisfaction scheduling has developed highly effective, deterministic heuri ..."
Abstract - Cited by 31 (14 self) - Add to MetaCart
In this paper, we investigate the use of stochastic variable and value ordering heuristics for solving job shop scheduling problems with non-relaxable deadlines and complex metric constraints. Previous research in constraint satisfaction scheduling has developed highly effective, deterministic

Generating feasible schedules under complex metric constraints

by Cheng-chung Cheng, Stephen F. Smith - in: Proc. AAAI-94 , 1994
"... In this paper, we consider the problem of finding feasible solutions to scheduling problems that are complicated by separation constraints on the execution of different operations. Following recent work in constraintposting scheduling, we formulate this problem as one of establishing ordering relati ..."
Abstract - Cited by 41 (12 self) - Add to MetaCart
In this paper, we consider the problem of finding feasible solutions to scheduling problems that are complicated by separation constraints on the execution of different operations. Following recent work in constraintposting scheduling, we formulate this problem as one of establishing ordering

Capacity of Ad Hoc Wireless Networks

by Jinyang Li, Charles Blake, Douglas S. J. De Couto, Hu Imm Lee, Robert Morris
"... Early simulation experience with wireless ad hoc networks suggests that their capacity can be surprisingly low, due to the requirement that nodes forward each others’ packets. The achievable capacity depends on network size, traffic patterns, and detailed local radio interactions. This paper examine ..."
Abstract - Cited by 636 (14 self) - Add to MetaCart
forwarding and the effect on capacity for several simple configurations and traffic patterns. While 802.11 discovers reasonably good schedules, we nonetheless observe capacities markedly less than optimal for very simple chain and lattice networks with very regular traffic patterns. We validate some

Generating Feasible Schedules for a Pick-Up and Delivery Problem

by Eric Domenjoud, Claude Kirchner, Jianyang Zhou - in « Electronic Notes in Discrete Mathematics , 1998
"... In this research, we study a transportation problem that involves vehicle routing and driver scheduling for a bus station. The problem requires drivers to provide pick-up and delivery services to customers. Its solution involves planning itineraries for buses and establishing working schedule for dr ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
and vehicles to requests. Based on this constraint model, efficient reactive planning and optimization algorithms are constructed to generate feasible schedules for the problem.

Routing In Clustered Multihop, Mobile Wireless Networks With Fading Channel

by Ching-chuan Chiang, Hsiao-kuang Wu, Winston Liu, Mario Gerla , 2005
"... A clusterhead-token infrastructure for multihop, mobile wireless networks has been designed. Traditional routing algorithms in wireline networks are not feasible for mobile wireless environment due to the dynamic change in link connectivity. To gain better performance for clustered multihop, mobile ..."
Abstract - Cited by 368 (9 self) - Add to MetaCart
A clusterhead-token infrastructure for multihop, mobile wireless networks has been designed. Traditional routing algorithms in wireline networks are not feasible for mobile wireless environment due to the dynamic change in link connectivity. To gain better performance for clustered multihop, mobile

Information Sciences Letters An International Journal Performance Assessment of Feasible Scheduling Multiprocessor Tasks Solutions by using DEA FDH method

by M. H. Shirvani, H. Alinejad-rokny , 2012
"... Abstract: In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article wi ..."
Abstract - Add to MetaCart
Abstract: In this paper, an attempt has been made to investigate how DEA FDH method based on linear programming can select one or more efficient scheduling solutions on multiprocessor tasks obtained by any heuristic algorithms through some feasible solutions for NP-complete problems. This article

1 Parallel Desynchronized Block Matching: A Feasible Scheduling Algorithm for the Input-Buffered Wavelength-Routed Switch

by P. Pavon-mariño, J. Garcia-haro, A. Jajszczyk
"... The Input-Buffered Wavelength-Routed (IBWR) switch is a promising switching architecture for slotted Optical Packet Switching (OPS) networks. The benefits of the IBWR fabric are a better scalability and lower hardware cost, when compared to output buffered OPS proposals. A previous work characterize ..."
Abstract - Add to MetaCart
, for the design of feasible IBWR scheduling algorithms, in terms of hardware implementation and execution time. As a result, the Parallel Desynchronized Block Matching (PDBM) algorithm is proposed. The evaluation results presented reveal that IBWR switch performance using the PDBM algorithm is close

Credit-Based Fair Queueing (CBFQ):A simple and feasible scheduling algorithm for packet networks

by Bensaou Chan, K. T. Chan, D. H. K. Tsang - Proceedings of IEEE ATM Workshop1997 , 1997
"... A simple rate-based scheduling algorithm for packet-switched networks (e.g. Internet, ATM) is proposed. By using simple counters to trace the amount of credits accumulated by each traffic stream, the algorithm decides which stream to serve next based on the bandwidth share allocated to each traffic ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
A simple rate-based scheduling algorithm for packet-switched networks (e.g. Internet, ATM) is proposed. By using simple counters to trace the amount of credits accumulated by each traffic stream, the algorithm decides which stream to serve next based on the bandwidth share allocated to each traffic

On the capacity of MIMO broadcast channel with partial side information

by Masoud Sharif, Babak Hassibi - IEEE TRANS. INFORM. THEORY , 2005
"... In multiple-antenna broadcast channels, unlike point-to-point multiple-antenna channels, the multiuser capacity depends heavily on whether the transmitter knows the channel coefficients to each user. For instance, in a Gaussian broadcast channel with transmit antennas and single-antenna users, the ..."
Abstract - Cited by 349 (9 self) - Add to MetaCart
, the sum rate capacity scales like log log for large if perfect channel state information (CSI) is available at the transmitter, yet only logarithmically with if it is not. In systems with large, obtaining full CSI from all users may not be feasible. Since lack of CSI does not lead to multiuser gains

Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms

by Leslie A. Hall, David B. Shmoys, Joel Wein , 1996
"... Time-indexed linear programming formulations have recently received a great deal of attention for their practical effectiveness in solving a number of single-machine scheduling problems. We show that these formulations are also an important tool in the design of approximation algorithms with good wo ..."
Abstract - Cited by 227 (24 self) - Add to MetaCart
worst-case performance guarantees. We give simple new rounding techniques to convert an optimal fractional solution into a feasible schedule for which we can prove a constant-factor performance guarantee, thereby giving the first theoretical evidence of the strength of these relaxations. Specifically
Results 1 - 10 of 2,886