Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 8 of 8

Full-Text Articles in Entire DC Network

Tabu Search For Optimization Of Military Supply Distribution, Ben Weber, Brett Bojduj, Jens G. Pohl Aug 2006

Tabu Search For Optimization Of Military Supply Distribution, Ben Weber, Brett Bojduj, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

The dynamic and non-hierarchical nature of the military domain presents a challenge for traditional supply chain optimization. Flow networks and simulation techniques have been applied to the military distribution problem, but are unable to provide time-definite delivery to customers. Recently, optimization approaches have been independently applied towards strategic and operational levels of planning. However, decomposing military distribution into separate problems forces optimization techniques to utilize imprecise data. The size of the military distribution problem has prevented optimization techniques from providing end-to-end planning capabilities. This paper presents a Tabu Search algorithm for simultaneously solving strategic and operational levels of planning. The …


An Energy-Efficient And Access Latency Optimized Indexing Scheme For Wireless Data Broadcast, Yuxia Yao, Xueyan Tang, Ee Peng Lim, Aixin Sun Aug 2006

An Energy-Efficient And Access Latency Optimized Indexing Scheme For Wireless Data Broadcast, Yuxia Yao, Xueyan Tang, Ee Peng Lim, Aixin Sun

Research Collection School Of Computing and Information Systems

Data broadcast is an attractive data dissemination method in mobile environments. To improve energy efficiency, existing air indexing schemes for data broadcast have focused on reducing tuning time only, i.e., the duration that a mobile client stays active in data accesses. On the other hand, existing broadcast scheduling schemes have aimed at reducing access latency through nonflat data broadcast to improve responsiveness only. Not much work has addressed the energy efficiency and responsiveness issues concurrently. This paper proposes an energy-efficient indexing scheme called MHash that optimizes tuning time and access latency in an integrated fashion. MHash reduces tuning time by …


Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve Jun 2006

Mabs: Spreadsheet– Based Decision Support For Precision Marketing, Bert De Reyck, Zeger Degraeve

Research Collection Lee Kong Chian School Of Business

In this paper, we describe a decision support system developed for automatically scheduling and optimising broadcasts of advertisements to mobile phones via SMS (Short Message Service) text messaging. The system, MABS or “Mobile Advertising Broadcast Scheduler”, is developed in Microsoft Excel with a link to Lingo, a modelling language and IP solver. It was developed for a London-based company specialized in location-sensitive precision marketing via mobile phones. The system significantly reduced the time required to schedule the broadcasts, and resulted both in increased customer response and revenues.


Distributed Approaches For Exploiting Multiuser Diversity In Wireless Networks, Xiangping Qin, Randall A. Berry Feb 2006

Distributed Approaches For Exploiting Multiuser Diversity In Wireless Networks, Xiangping Qin, Randall A. Berry

Articles

In wireless fading channels, multiuser diversity can be exploited by scheduling users to transmit when their channel conditions are favorable. This leads to a sum throughput that increases with the number of users and, in certain cases, achieves capacity. However, such scheduling requires global knowledge of every user’s channel gain, which may be difficult to obtain in some situations. This paper addresses contention-based protocols for exploiting multiuser diversity with only local channel knowledge. A variation of the ALOHA protocol is given in which users attempt to exploit multiuser diversity gains, but suffer contention losses due to the distributed channel knowledge. …


Allocating Non-Real-Time And Soft Real-Time Jobs In Multiclusters, Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd Feb 2006

Allocating Non-Real-Time And Soft Real-Time Jobs In Multiclusters, Ligang He, Stephen A. Jarvis, Daniel P. Spooner, Hong Jiang, Donna N. Dillenberger, Graham R. Nudd

School of Computing: Faculty Publications

This paper addresses workload allocation techniques for two types of sequential jobs that might be found in multicluster systems, namely, non-real-time jobs and soft real-time jobs. Two workload allocation strategies, the Optimized mean Response Time (ORT) and the Optimized mean Miss Rate (OMR), are developed by establishing and numerically solving two optimization equation sets. The ORT strategy achieves an optimized mean response time for non-real-time jobs, while the OMR strategy obtains an optimized mean miss rate for soft real-time jobs over multiple clusters. Both strategies take into account average system behaviors (such as the mean arrival rate of jobs) in …


Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz Jan 2006

Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz

Faculty of Informatics - Papers (Archive)

In this paper, the problem of scheduling multiple users sharing a time varying wireless channel is studied, in networks such as in 3G CDMA and IEEE 802.16. We propose a new generic wireless packet scheduling framework (WPSF), which takes into account not only the quality of service (QoS) requirements but also the wireless resource consumed. The framework is generic in the sense that it can be used with different resource constraints and QoS requirements depending on the traffic flow types. Subsequently, based on this framework a minimum rate and channel aware (MRCA) scheduling algorithm is presented. MRCA attempts to greedily …


Improving Mobile Station Energy Efficiency In Ieee 802.16e Wman By Burst Scheduling, Jinglin Shi, Gengfa Fang, Yi Sun, Jihua Zhou, Zhongcheng Li, Eryk Dutkiewicz Jan 2006

Improving Mobile Station Energy Efficiency In Ieee 802.16e Wman By Burst Scheduling, Jinglin Shi, Gengfa Fang, Yi Sun, Jihua Zhou, Zhongcheng Li, Eryk Dutkiewicz

Faculty of Informatics - Papers (Archive)

In this paper, we tackle the packet scheduling problem in IEEE 802.16e wireless metropolitan area network (WMAN), where the Sleep Mode is applied to save energy of mobile stations (MSs). Our objective is to design an energy efficient scheduling policy which works closely with the sleep mode mechanism so as to maximize battery lifetime in MSs. To the best of our knowledge no power saving scheduling algorithms based on sleep mode defined in IEEE 802.16e have been proposed so far in the literature. We propose a longest virtual burst first (LVBF) scheduling algorithm which schedules packets of MSs in a …


A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem Jan 2006

A Tabu Search Algorithm To Minimize The Makespan For The Unrelated Parallel Machines Scheduling Problem With Setup Times, Magdy Helal, Ghaith Rabadi, Ameer Al-Salem

Engineering Management & Systems Engineering Faculty Publications

In this paper we propose a tabu search implementation to solve the unrelated parallel machines scheduling problem with sequence- and machine- dependent setup times to minimize the schedules makespan. The problem is NP-hard and finding an optimal solution efficiently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The proposed tabu search algorithm uses two phases of perturbation schemes: the intra-machine perturbation, which optimizes the sequence of jobs on the machines, and the inter-machine perturbation, which balances the assignment of the jobs to the machines. We compare the proposed algorithm to an existing one that addressed the …