Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
Articles 1 - 11 of 11
Full-Text Articles in Entire DC Network
Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen
Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP, …
Mixed-Criticality Scheduling To Minimize Makespan, Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo
Mixed-Criticality Scheduling To Minimize Makespan, Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo
Computer Science Faculty Research & Creative Works
In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical. The desired execution semantics are that all jobs should execute correctly provided all jobs complete upon being allowed to execute for up to the smaller of their execution time estimates, whereas if some jobs need to execute beyond their smaller execution time estimates (but not beyond their larger execution time estimates), then only the jobs …
Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen
Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3271. The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the …
A Dynamic Run-Profile Energy-Aware Approach For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali
A Dynamic Run-Profile Energy-Aware Approach For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali
Computer Science Faculty Proceedings & Presentations
High Performance Computing (HPC) resources are housed in large datacenters, which consume exorbitant amounts of energy and are quickly demanding attention from businesses as they result in high operating costs. On the other hand HPC environments have been very useful to researchers in many emerging areas in life sciences such as Bioinformatics and Medical Informatics. In an earlier work, we introduced a dynamic model for energy aware scheduling (EAS) in a HPC environment; the model is domain agnostic and incorporates both the deadline parameter as well as energy parameters for computationally intensive applications. Our proposed EAS model incorporates 2-phases. In …
Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham
Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Emergency Medical Systems (EMSs) are an important component of public health-care services. Improving infrastructure for EMS and specifically the construction of base stations at the ”right” locations to reduce response times is the main focus of this paper. This is a computationally challenging task because of the: (a) exponentially large action space arising from having to consider combinations of potential base locations, which themselves can be significant; and (b) direct impact on the performance of the ambulance allocation problem, where we decide allocation of ambulances to bases. We present an incremental greedy approach to discover the placement of bases that …
Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein
Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDP is an expressive model for multi-agent planning. Finite-state controllers (FSCs)---often used to represent policies for infinite-horizon problems---offer a compact, simple-to-execute policy representation. We exploit novel connections between optimizing decentralized FSCs and the dual linear program for MDPs. Consequently, we describe a dual mixed integer linear program (MIP) for optimizing deterministic FSCs. We exploit the Dec-POMDP structure to devise a compact MIP and formulate constraints that result in policies executable in partially-observable decentralized settings. We show analytically that the dual formulation can also be exploited within the expectation maximization (EM) framework to optimize stochastic FSCs. The resulting EM algorithm …
Ad Revenue Optimization In Live Broadcasting, Dana G. Popescu, Pascale Crama
Ad Revenue Optimization In Live Broadcasting, Dana G. Popescu, Pascale Crama
Research Collection Lee Kong Chian School Of Business
In live broadcasting, the break lengths available for commercials are not always fixed and known in advance (e.g., strategic and injury time-outs are of variable duration in live sports transmissions). Broadcasters actively manage their advertising revenue by jointly optimizing sales and scheduling policies. We characterize the optimal dynamic schedule in a simplified setting that incorporates stochastic break durations and advertisement lengths of 15 and 30 seconds. The optimal policy is a "greedy" look-ahead rule that accounts for the remaining number of breaks; in this setting, there is no value to perfect information at the scheduling stage, and hence knowing 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.
Simulation Based Design And Testing Of A Supervisory Controller For Reducing Peak Demand In Buildings, James Nutaro, Ozgur Ozmen, Jibonananda Sanyal, David Fugate, Teja Kuruganti
Simulation Based Design And Testing Of A Supervisory Controller For Reducing Peak Demand In Buildings, James Nutaro, Ozgur Ozmen, Jibonananda Sanyal, David Fugate, Teja Kuruganti
International High Performance Buildings Conference
We describe a supervisory control strategy for limiting peak power demand by small and medium commercial buildings while still meeting the business needs of the occupants. The objective of the supervisory control is to operate no more than
Closed-Loop Scheduling For Cost Minimization In Hvac Central Plants, Michael J. Risbeck, Christos T. Maravelias, James B. Rawlings, Robert D. Turney
Closed-Loop Scheduling For Cost Minimization In Hvac Central Plants, Michael J. Risbeck, Christos T. Maravelias, James B. Rawlings, Robert D. Turney
International High Performance Buildings Conference
In this paper, we examine closed-loop operation of an HVAC central plant to demonstrate that closed-loop receding-horizon scheduling provides robustness to inaccurate forecasts, and that economic performance is not seriously impaired by shortened prediction horizons or inaccurate forecasts when feedback is employed. Using a general mixed-integer linear programming formulation for the scheduling problem, we show that optimization can be performed in real time. Furthermore, we demonstrate that closed-loop operation with a moderate prediction horizon is not significantly worse than a long-horizon implementation in the nominal case, and that closed-loop operation can correct for inaccurate long-term forecasts without significant cost increase. …
Single Machine Scheduling With Job-Dependent Machine Deterioration, Wenchang Luo, Xu Yao, Weitian Tong, Guohui Lin
Single Machine Scheduling With Job-Dependent Machine Deterioration, Wenchang Luo, Xu Yao, Weitian Tong, Guohui Lin
Department of Computer Science Faculty Publications
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid machine breakdown, one should guarantee a non-negative maintenance level at any time point; and whenever necessary, a maintenance activity must be allocated for restoring the machine maintenance level. The goal of the problem is to schedule the jobs and the maintenance …