Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication Year
Articles 1 - 19 of 19
Full-Text Articles in Entire DC Network
Device-To-Device Communication In 5g: Towards Efficient Scheduling, Jana Fayek, Mohamad Aoude, Mohamad Raad, Raad Raad
Device-To-Device Communication In 5g: Towards Efficient Scheduling, Jana Fayek, Mohamad Aoude, Mohamad Raad, Raad Raad
Faculty of Engineering and Information Sciences - Papers: Part B
5G wireless networks are expected to carry large traffic volumes due to the growth of mobile devices and the increasing demand for high data rates from applications. Device to device communication is one of the suggested technologies to support this increasing load and enhance the capacity of networks. However, the implementation of D2D communication reveals many barriers that include communication scheduling, for which the architecture remains complex and obscure. In this paper, an overview of the available literature on the implementation of networks supporting D2D communication is presented, emphasizing the complexity of the offered solutions. This paper also offers a …
Channel Autocorrelation-Based Dynamic Slot Scheduling For Body Area Networks, Hongyun Zhang, Farzad Safaei, Le Chung Tran
Channel Autocorrelation-Based Dynamic Slot Scheduling For Body Area Networks, Hongyun Zhang, Farzad Safaei, Le Chung Tran
Faculty of Engineering and Information Sciences - Papers: Part B
As a promising technology in the context of m-health and e-medical, wireless body area networks (WBANs) have a stringent requirement in terms of transmission reliability. Meanwhile, the wireless channel in WBANs is prone to deep fading due to multiple reasons, such as shadowing by the body, reflection, diffraction, and interference. To meet the challenge in transmission reliability, the dynamic slot scheduling (DSS) methods have attracted considerable interest in recent years. DSS method does not require extra hardware or software overhead on the sensor side. Instead, the hub optimizes the time-division multiple access slots by selecting the best permutation at the …
Simulation-Based Evaluation Of An Integrated Planning And Scheduling Algorithm For Maintenance Projects, Rohit Patil, Nagesh Shukla, Senevi Kiridena
Simulation-Based Evaluation Of An Integrated Planning And Scheduling Algorithm For Maintenance Projects, Rohit Patil, Nagesh Shukla, Senevi Kiridena
SMART Infrastructure Facility - Papers
The field of maintenance project planning and scheduling is attracting increasing attention due to ever growing competition among manufacturing organisations. There is a lack of studies that has tackled all the aspects of maintenance project implementation such as costs, resources, down times, uncertainties, operational constraints, among others. Therefore, an approach which uses a unitary structuring method and discrete event simulation to integrate relevant data about the maintenance projects is proposed. The results of the evaluation, on a case from paper-pulp industry, have shown that the proposed approach is able to overcome most of the issues of maintenance planning and scheduling.
On Transformation Of Query Scheduling Strategies In Distributed And Heterogeneous Database Systems, Janusz R. Getta, - Handoko
On Transformation Of Query Scheduling Strategies In Distributed And Heterogeneous Database Systems, Janusz R. Getta, - Handoko
Faculty of Engineering and Information Sciences - Papers: Part A
This work considers a problem of optimal query processing in heterogeneous and distributed database systems. A global query sub- mitted at a local site is decomposed into a number of queries processed at the remote sites. The partial results returned by the queries are in- tegrated at a local site. The paper addresses a problem of an optimal scheduling of queries that minimizes time spend on data integration of the partial results into the final answer. A global data model defined in this work provides a unified view of the heterogeneous data structures located at the remote sites and a …
An Effective Asexual Genetic Algorithm For Solving The Job Shop Scheduling Problem, Mehrdad Amirghasemi, Reza R. Zamani
An Effective Asexual Genetic Algorithm For Solving The Job Shop Scheduling Problem, Mehrdad Amirghasemi, Reza R. Zamani
Faculty of Engineering and Information Sciences - Papers: Part A
All rights reserved. Abstract By using the notion of elite pool, this paper presents an effective asexual genetic algorithm for solving the job shop scheduling problem. Based on mutation operations, the algorithm selectively picks the solution with the highest quality from the pool and after its modification, it can replace the solution with the lowest quality with such a modified solution. The elite pool is initially filled with a number of non-delay schedules, and then, in each iteration, the best solution of the elite pool is removed and mutated in a biased fashion through running a limited tabu search procedure. …
Uncertainty Management In Multiobjective Hydro-Thermal Self-Scheduling Under Emission Considerations, Jamshid Aghaei, Abdollah Ahmadi, Abdorreza Rabiee, Vassilios G. Agelidis, Kashem M. Muttaqi, H A. Shayanfar
Uncertainty Management In Multiobjective Hydro-Thermal Self-Scheduling Under Emission Considerations, Jamshid Aghaei, Abdollah Ahmadi, Abdorreza Rabiee, Vassilios G. Agelidis, Kashem M. Muttaqi, H A. Shayanfar
Faculty of Engineering and Information Sciences - Papers: Part A
In this paper, a stochastic multiobjective framework is proposed for a day-ahead short-term Hydro Thermal Self-Scheduling (HTSS) problem for joint energy and reserve markets. An efficient linear formulations are introduced in this paper to deal with the nonlinearity of original problem due to the dynamic ramp rate limits, prohibited operating zones, operating services of thermal plants, multi-head power discharge characteristics of hydro generating units and spillage of reservoirs. Besides, system uncertainties including the generating units' contingencies and price uncertainty are explicitly considered in the stochastic market clearing scheme. For the stochastic modeling of probable multiobjective optimization scenarios, a lattice Monte …
Containership Routing And Scheduling In Liner Shipping: Overview And Future Research Directions, Qiang Meng, Shuaian Wang, Henrik Andersson, Kristian Thun
Containership Routing And Scheduling In Liner Shipping: Overview And Future Research Directions, Qiang Meng, Shuaian Wang, Henrik Andersson, Kristian Thun
Faculty of Engineering and Information Sciences - Papers: Part A
This paper reviews studies from the past 30 years that use operations research methods to tackle containership routing and scheduling problems at the strategic, tactical, and operational planning levels. These problems are first classified and summarized, with a focus on model formulations, assumptions, and algorithm design. The paper then gives an overview of studies on containership fleet size and mix, alliance strategy, and network design (at the strategic level); frequency determination, fleet deployment, speed optimization, and schedule design (at the tactical level); and container booking and routing and ship rescheduling (at the operational level). The paper further elaborates on the …
Delay Aware Joint Routing And Scheduling For Multi-Tx-Rx Wireless Mesh Networks, Luyao Wang, Kwan-Wu Chin, Raad Raad, Sieteng Soh
Delay Aware Joint Routing And Scheduling For Multi-Tx-Rx Wireless Mesh Networks, Luyao Wang, Kwan-Wu Chin, Raad Raad, Sieteng Soh
Faculty of Engineering and Information Sciences - Papers: Part A
Recently, researchers have created Wireless Mesh Networks (WMNs) where routers have multiple transmit (Tx) or receive (Rx) capability. A fundamental problem in such WMNs is deriving a transmission schedule that yields minimal end-to-end delays. In this paper, we approach this problem via joint routing and link scheduling. Specifically, we consider two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. We propose two algorithms: JRS-Multi-DEC and JRS-BIP, where the former uses a novel metric to minimize the load of each link whilst the latter uses a binary integer program solver. Both algorithms have the similar aim of …
Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani
Integrating Iterative Crossover Capability In Orthogonal Neighborhoods For Scheduling Resource-Constrained Projects, Reza Zamani
Faculty of Engineering and Information Sciences - Papers: Part A
An effective hybrid evolutionary search method is presented which integrates a genetic algorithm with a local search. Whereas its genetic algorithm improves the solutions obtained by its local search, its local search component utilizes a synergy between two neighborhood schemes in diversifying the pool used by the genetic algorithm. Through the integration of these two searches, the crossover operators further enhance the solutions that are initially local optimal for both neighborhood schemes; and the employed local search provides fresh solutions for the pool whenever needed. The joint endeavor of its local search mechanism and its genetic algorithm component has made …
Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar
Mip-Based Stochastic Security-Constrained Daily Hydrothermal Generation Scheduling, J Aghaei, M Karami, K M. Muttaqi, A Ahmadi, H A. Shayanfar
Faculty of Engineering and Information Sciences - Papers: Part A
This paper presents the application of a mixedinteger programming (MIP) approach for solving stochastic security-constrained daily hydrothermal generation scheduling (SCDHGS). Power system uncertainties including generating units and branch contingencies and load uncertainty are explicitly considered in the stochastic programming of SCDHGS. The roulette wheel mechanism and lattice Monte Carlo simulation (LMCS) are first employed for random scenario generation wherein the stochastic SCDHGS procedure is converted into its respective deterministic equivalents (scenarios). Then, the generating units are scheduled through MIP over the set of deterministic scenarios for the purpose of minimizing the cost of supplying energy and ancillary services over the …
A Polarized Adaptive Schedule Generation Scheme For The Resource-Constrained Project Scheduling Problem, Reza Zamani
A Polarized Adaptive Schedule Generation Scheme For The Resource-Constrained Project Scheduling Problem, Reza Zamani
Faculty of Informatics - Papers (Archive)
This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is incorporated into a novel genetic algorithm that never degenerates, resulting in an effective self-adaptive procedure. The key point of this genetic algorithm is the embedding of the polarizer parameter as a gene …
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Fairness And Capacity Analysis Of Opportunistic Feedback Protocol With Proportional Fair Or Maximum Throughput Scheduling, Hang Li, Qinghua Guo, Licai Fang, Defeng (David) Huang
Faculty of Engineering and Information Sciences - Papers: Part A
An opportunistic feedback protocol with maximum throughput (MT) scheduling has been proposed in the literature to achieve multiuser diversity for the downlink transmission of a wireless system, and its system capacity has been analyzed with the assumption that the received signal-to-noise ratios (SNRs) for the users are independent and identically distributed. In this paper, fairness and capacity performances of the opportunistic feedback protocol are analyzed for SNRs with independent but not necessarily identical distributions. In addition to MT scheduling, we also analyze the fairness and capacity performances for proportional fair (PF) scheduling. Compared with MT scheduling, numerical results demonstrate that …
Aircraft Maintenance Planning And Scheduling: An Integrated Framework, Premaratne Samaranayake, Senevi Kiridena
Aircraft Maintenance Planning And Scheduling: An Integrated Framework, Premaratne Samaranayake, Senevi Kiridena
Faculty of Engineering - Papers (Archive)
Purpose – The purpose of this paper is to examine how certain limitations of the current approaches to planning and scheduling of aircraft heavy maintenance can be addressed using a single integrated framework supported by unified data structures. Design/methodology/approach – The “unitary structuring technique”, originally developed within the context of manufacturing planning and control, is further enhanced for aircraft heavy maintenance applications, taking into account the uncertainty associated with condition-based maintenance. The proposed framework delivers the advanced functionalities required for simultaneous and dynamic forward planning of maintenance operations, as well as finite loading of resources, towards optimising the overall maintenance …
Support-Based Distributed Optimisation: An Approach To Radiotherapy Patient Scheduling, Graham Billiau, Chee-Fon Chang, Andrew Alexis Miller, Aditya K. Ghose
Support-Based Distributed Optimisation: An Approach To Radiotherapy Patient Scheduling, Graham Billiau, Chee-Fon Chang, Andrew Alexis Miller, Aditya K. Ghose
Faculty of Informatics - Papers (Archive)
In the health system inefficiency leads to poor use of scarce expensive resources. Lengthy patient treatment waiting time can result from inefficiency in scheduling. The use of state-of-the art multi-agent and distributed computing technologies can provide a solution to address this problem. However, distributed optimisation in such a multi-agent setting poses an important challenge that requires protocols to enable agents to optimise shared objectives without necessarily revealing all of their private constraints. In this study we show that if the problem is expressed as a Dynamic Distributed Constraint Optimisation Problem a powerful algorithm such as SBDO can be deployed to …
Energy-Efficient Scheduling In Wmsns, Mohamed K. Watfa, Farah Abou Shahla
Energy-Efficient Scheduling In Wmsns, Mohamed K. Watfa, Farah Abou Shahla
University of Wollongong in Dubai - Papers
Recent technological breakthroughs in ultra-high integration and low-power electronics have enabled the development of tiny battery-operated sensors. The signal processing and communication activities are the main consumers of sensor’s energy. Since sensors are battery-operated, keeping the sensor active all the time will limit the battery’s lifetime. Therefore, optimal organization and management of the sensor network is crucial in order to perform the desired function with an acceptable level of quality and to maintain sufficient sensor energy for the required mission. Wireless multimedia sensor networks (WMSN) are a new and emerging type of sensor networks producing multimedia content. These networks have …
A Heuristic Search Algorithm For Flow-Shop Scheduling, Joshua P. Fan, Graham K. Winley
A Heuristic Search Algorithm For Flow-Shop Scheduling, Joshua P. Fan, Graham K. Winley
Sydney Business School - Papers
This article describes the development of a new intelligent heuristic search algorithm (IHSA*) which guarantees an optimal solution for flow-shop problems with an arbitrary number of jobs and machinesprovided the job sequence is constrained to be the same on each machine. The development is described in terms of 3 modifications made to the initial version of IHSA*. The first modification concerns thechoice of an admissible heuristic function. The second concerns the calculation of heuristic estimates as the search for an optimal solution progresses, and the third determines multiple optimal solutions whenthey exist. The first 2 modifications improve performance characteristics of …
Introducing Algorithm Portfolios To A Class Of Vehicle Routing And Scheduling Problem, Nagesh Shukla, Yogesh Dashora, M K. Tiwari, F T. S Chan, T C. Wong
Introducing Algorithm Portfolios To A Class Of Vehicle Routing And Scheduling Problem, Nagesh Shukla, Yogesh Dashora, M K. Tiwari, F T. S Chan, T C. Wong
Faculty of Engineering and Information Sciences - Papers: Part A
The paper presents a comprehensive foundation and implementation of Algorithm Portfolios to solve Theater Distribution Vehicle Routing and Scheduling Problems (TDVRSP). In order to evaluate the performance of proposed approach, it has been applied to varying dimensions of theater distribution problem. In particular, eight random search metaheuristics embedded in four processors, packed to form different portfolios. Four basic algorithms- Genetic Algorithm (GA), Simulated Annealing (SA), Tabu Search (TS) and Artificial Immune System (AIS), as well as their group theoretic counterparts have been utilized. The proposed approach also takes care of platform dependence and helps evolving a robust solution pack. The …
Generic Scheduling Framework And Algorithm For Time-Varying Wireless Networks, Gengfa Fang, Yi Sun, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz
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
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 …