Learn More
Hydroelectric power utilities convert the potential energy of water to electricity through the operation of generation turbines. Each turbine unit has an operating range and incurs a fixed start-up cost. The problem of determining which turbines should be operating at any point during the day whilst ensuring that the demand for electricity is satisfied is(More)
We consider the scheduling of the annual maintenance for the Hunter Valley Coal Chain. The coal chain is a system comprising load points, railway track and different types of terminal equipment, interacting in a complex way. A variety of maintenance tasks have to be performed on all parts of the infrastructure on a regular basis in order to assure the(More)
We consider the problem of scheduling a set of maintenance jobs on the arcs of a network so that the total flow over the planning time horizon is maximized. A maintenance job causes an arc outage for its duration, potentially reducing the capacity of the network. The problem can be expected to have applications across a range of network infrastructures(More)
Strathprints is designed to allow users to access the research output of the University of Strathclyde. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. You may not engage in further distribution of the material for any profitmaking activities or any commercial gain. You may(More)
BACKGROUND Previously, we reported that elevated extracellular potassium concentration in vitro inhibited proliferation and migration of vascular smooth muscle cells, formation of free radical compounds by macrophages, and reduced platelet sensitivity to agonists. More recently, we described a reduction in neointimal proliferation after balloon angioplasty(More)
This paper tackles a generalization of the weight constrained shortest path problem in a directed network (WCSPP) in which replenishment arcs, that reset the accumulated weight along the path to zero, appear in the network. Such situations arise, for example, in airline crew pairing applications, where the weight represents duty hours, and replenishment(More)
A big bucket time indexed mixed integer linear programming formulation for nonpreemptive single machine scheduling problems is presented in which the length of each period can be as large as the processing time of the shortest job. The model generalises the classical time indexed model to one in which at most two jobs can be processing in each period. The(More)