Train schedule coordination at an interchange station through Agent negotiation

In open railway markets, coordinating train schedules at an interchange station requires negotiation between two independent train operating companies to resolve their operational conflicts. This paper models the stakeholders as software agents and proposes an agent negotiation model to study their interaction. Three negotiation strategies have been devised to represent the possible objectives of the stakeholders, and they determine the behavior in proposing offers to the proponent. Empirical simulation results confirm that the use of the proposed negotiation strategies lead to outcomes that are consistent with the objectives of the stakeholders.

The impact of location on contribution schedule lot entitlements

Should the owner of a penthouse unit pay more in body corporate levies than the ground floor unit owner? A decision of the Queensland Court of Appeal (McPherson JA, Chesterman and Atkinson JJ) will be of great interest to those seeking to challenge contribution schedule lot entitlements imposed under the Body Corporate and Community Management Act 1997 (Qld) (‘the Act’). The decision is Fischer v Body Corporate for Centrepoint Community Title Scheme 7779 [2004] QCA 214.

Charting the system : the integrated master schedule as a multi-level and poly-temporal boundary object in complex projects

This paper investigates the use of visual artifacts to represent a complex adaptive system (CAS). The integrated master schedule (IMS) is one of those visuals widely used in complex projects for scheduling, budgeting, and project management. In this paper, we discuss how the IMS outperforms the traditional timelines and acts as a ‘multi-level and poly-temporal boundary object’ that visually represents the CAS. We report the findings of a case study project on the way the IMS mapped interactions, interdependencies, constraints and fractal patterns in a complex project. Finally, we discuss how the IMS was utilised as a complex boundary object by eliciting commitment and development of shared mental models, and facilitating negotiation through the layers of multiple interpretations from stakeholders.

Genetic algorithms to schedule container transfers at multimodal terminals

Optimising the container transfer schedule at the multimodal terminals is known to be NP-hard, which implies that the best solution becomes computationally infeasible as problem sizes increase. Genetic Algorithm (GA) techniques are used to reduce container handling/transfer times and ships' time at the port by speeding up handling operations. The GA is chosen due to the relatively good results that have been reported even with the simplest GA implementations to obtain near-optimal solutions in reasonable time. Also discussed, is the application of the model to assess the consequences of increased scheduled throughput time as well as different strategies such as the alternative plant layouts, storage policies and number of yard machines. A real data set used for the solution and subsequent sensitivity analysis is applied to the alternative plant layouts, storage policies and number of yard machines.

Temporal boundary objects in megaprojects : mapping the system with the integrated master schedule

Recently, a stream of project management research has recognized the critical role of boundary objects in the organization of projects. In this paper, we investigate how one advanced scheduling tool, the Integrated Master Schedule (IMS), is used as a temporal boundary object at various stages of complex projects. The IMS is critical to megaprojects which typically span long periods of time and face a high degree of complexity and uncertainty. In this paper, we conceptualize projects of this type as complex adaptive systems (CAS). We report the findings of four case projects on how the IMS mapped interactions, interdependencies, constraints, and fractal patterns of these emerging projects, and how the process of IMS visualization enabled communication and negotiation of project realities. This paper highlights that this advanced timeline tool acts as a boundary object and elicits shared understanding of complex projects from their stakeholders.

Effects of schedule pressure on construction performance

Accelerating a project can be rewarding. The consequences, however, can be troublesome if productivity and quality are sacrificed for the sake of remaining ahead of schedule, such that the actual schedule benefits are often barely worth the effort. The tradeoffs and paths of schedule pressure and its causes and effects are often overlooked when schedule decisions are being made. This paper analyses the effects that schedule pressure has on construction performance, and focuses on tradeoffs in scheduling. A research framework has been developed using a causal diagram to illustrate the cause-and-effect analysis of schedule pressure. An empirical investigation has been performed by using survey data collected from 102 construction practitioners working in 38 construction sites in Singapore. The results of this survey data analysis indicate that advantages of increasing the pace of work—by working under schedule pressure—can be offset by losses in productivity and quality. The negative effects of schedule pressure arise mainly by working out of sequence, generating work defects, cutting corners, and losing the motivation to work. The adverse effects of schedule pressure can be minimized by scheduling construction activities realistically and planning them proactively, motivating workers, and by establishing an effective project coordination and communication mechanism.

The operating schedule for battery energy storage companies in electricity market

This paper presents a series of operating schedules for Battery Energy Storage Companies (BESC) to provide peak shaving and spinning reserve services in the electricity markets under increasing wind penetration. As individual market participants, BESC can bid in ancillary services markets in an Independent System Operator (ISO) and contribute towards frequency and voltage support in the grid. Recent development in batteries technologies and availability of the day-ahead spot market prices would make BESC economically feasible. Profit maximization of BESC is achieved by determining the optimum capacity of Energy Storage Systems (ESS) required for meeting spinning reserve requirements as well as peak shaving. Historic spot market prices and frequency deviations from Australia Energy Market Operator (AEMO) are used for numerical simulations and the economic benefits of BESC is considered reflecting various aspects in Australia’s National Electricity Markets (NEM).

Management of a high grade pan stage schedule to reduce the steam consumption

MOST PAN stages in Australian factories use only five or six batch pans for the high grade massecuite production and operate these in a fairly rigid repeating production schedule. It is common that some of the pans are of large dropping capacity e.g. 150 to 240 t. Because of the relatively small number and large sizes of the pans, steam consumption varies widely through the schedule, often by ±30% about the mean value. Large fluctuations in steam consumption have implications for the steam generation/condensate management of the factory and the evaporators when bleed vapour is used. One of the objectives of a project to develop a supervisory control system for a pan stage is to (a) reduce the average steam consumption and (b) reduce the variation in the steam consumption. The operation of each of the high grade pans within the schedule at Macknade Mill was analysed to determine the idle (or buffer) time, time allocations for essential but unproductive operations (e.g. pan turn round, charging, slow ramping up of steam rates on pan start etc.), and productive time i.e. the time during boil-on of liquor and molasses feed. Empirical models were developed for each high grade pan on the stage to define the interdependence of the production rate and the evaporation rate for the different phases of each pan’s cycle. The data were analysed in a spreadsheet model to try to reduce and smooth the total steam consumption. This paper reports on the methodology developed in the model and the results of the investigations for the pan stage at Macknade Mill. It was found that the operation of the schedule severely restricted the ability to reduce the average steam consumption and smooth the steam flows. While longer cycle times provide increased flexibility the steam consumption profile was changed only slightly. The ability to cut massecuite on the run among pans, or the use of a high grade seed vessel, would assist in reducing the average steam consumption and the magnitude of the variations in steam flow.

A new analytical approach to optimize a generation schedule

Identification of the optimum generation schedule by various methods of coordinating incremental generation costs and incremental transmission losses has been described previously in the literature. This paper presents an analytical approach which reduces the time-consuming iterative procedure into a mere positive-root determination of a third-order polynomial in λ. This approach includes the effect of transmission losses and is suitable for systems with any number of plants. The validity and effectiveness of this method are demonstrated by analysing a sample system.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Comparison of Optimum Reactive Power Schedule with Different Objectives Using LP Technique

Three algorithms for reactive power optimization are proposed in this paper with three different objective functions. The objectives in the proposed algorithm are to minimize the sum of the squares of the voltage deviations of the load buses, minimization of sum of squares of voltage stability L-indices of load buses (:3L2) algorithm, and also the objective of system real power loss (Ploss) minimization. The approach adopted is an iterative scheme with successive power flow analysis using decoupled technique and solution of the linear programming problem using upper bound optimization technique. Results obtained with all these objectives are compared. The analysis of these objective functions are presented to illustrate their advantages. It is observed comparing different objective functions it is possible to identify critical On Load Tap Changers (OLTCs) that should be made manual to avoid possible voltage instability due to their operation based on voltage improvement criteria under heavy load conditions. These algorithms have been tested under simulated conditions on few test systems. The results obtained on practical systems of 24-node equivalent EHV Indian power network, and for a 205 bus EHV system are presented for illustration purposes.