A survey of scheduling problems with setup times or costs

Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

A new hybrid meta-heuristic algorithm for solving single machine scheduling problems

A dissertation submitted in partial ful lment of the degree of Master of Science in Engineering (Electrical) (50/50) in the Faculty of Engineering and the Built Environment Department of Electrical and Information Engineering May 2017Numerous applications in a wide variety of elds has resulted in a rich history of research into optimisation for scheduling. Although it is a fundamental form of the problem, the single machine scheduling problem with two or more objectives is known to be NP-hard. For this reason we consider the single machine problem a good test bed for solution algorithms. While there is a plethora of research into various aspects of scheduling problems, little has been done in evaluating the performance of the Simulated Annealing algorithm for the fundamental problem, or using it in combination with other techniques. Speci cally, this has not been done for minimising total weighted earliness and tardiness, which is the optimisation objective of this work. If we consider a mere ten jobs for scheduling, this results in over 3.6 million possible solution schedules. It is thus of de nite practical necessity to reduce the search space in order to nd an optimal or acceptable suboptimal solution in a shorter time, especially when scaling up the problem size. This is of particular importance in the application area of packet scheduling in wireless communications networks where the tolerance for computational delays is very low. The main contribution of this work is to investigate the hypothesis that inserting a step of pre-sampling by Markov Chain Monte Carlo methods before running the Simulated Annealing algorithm on the pruned search space can result in overall reduced running times. The search space is divided into a number of sections and Metropolis-Hastings Markov Chain Monte Carlo is performed over the sections in order to reduce the search space for Simulated Annealing by a factor of 20 to 100. Trade-o s are found between the run time and number of sections of the pre-sampling algorithm, and the run time of Simulated Annealing for minimising the percentage deviation of the nal result from the optimal solution cost. Algorithm performance is determined both by computational complexity and the quality of the solution (i.e. the percentage deviation from the optimal). We nd that the running time can be reduced by a factor of 4.5 to ensure a 2% deviation from the optimal, as compared to the basic Simulated Annealing algorithm on the full search space. More importantly, we are able to reduce the complexity of nding the optimal from O(n:n!) for a complete search to O(nNS) for Simulated Annealing to O(n(NMr +NS)+m) for the input variables n jobs, NS SA iterations, NM Metropolis- Hastings iterations, r inner samples and m sections.MT 201

Energy Management Expert Assistant, a New Concept

In recent years, interest in home energy management systems (HEMS) has grown significantly, as well as the development of Voice Assistants that substantially increase home comfort. This paper presents a novel merging of HEMS with the Assistant paradigm. The combination of both concepts has allowed the creation of a high-performance and easy-to-manage expert system (ES). It has been developed in a framework that includes, on the one hand, the efficient energy management functionality boosted with an Internet of Things (IoT) platform, where artificial intelligence (AI) and big data treatment are blended, and on the other hand, an assistant that interacts both with the user and with the HEMS itself. The creation of this ES has made it possible to optimize consumption levels, improve security, efficiency, comfort, and user experience, as well as home security (presence simulation or security against intruders), automate processes, optimize resources, and provide relevant information to the user facilitating decision making, all based on a multi-objective optimization (MOP) problem model. This paper presents both the scheme and the results obtained, the synergies generated, and the conclusions that can be drawn after 24 months of operation

Distributed Stochastic Market Clearing with High-Penetration Wind Power

Integrating renewable energy into the modern power grid requires risk-cognizant dispatch of resources to account for the stochastic availability of renewables. Toward this goal, day-ahead stochastic market clearing with high-penetration wind energy is pursued in this paper based on the DC optimal power flow (OPF). The objective is to minimize the social cost which consists of conventional generation costs, end-user disutility, as well as a risk measure of the system re-dispatching cost. Capitalizing on the conditional value-at-risk (CVaR), the novel model is able to mitigate the potentially high risk of the recourse actions to compensate wind forecast errors. The resulting convex optimization task is tackled via a distribution-free sample average based approximation to bypass the prohibitively complex high-dimensional integration. Furthermore, to cope with possibly large-scale dispatchable loads, a fast distributed solver is developed with guaranteed convergence using the alternating direction method of multipliers (ADMM). Numerical results tested on a modified benchmark system are reported to corroborate the merits of the novel framework and proposed approaches.Comment: To appear in IEEE Transactions on Power Systems; 12 pages and 9 figure

The effect of supply chain noise on the financial performance of Kanban and Drum-Buffer-Rope: An agent-based perspective

Managing efficiently the flow of products throughout the supply chain is essential for succeeding in today's marketplace. We consider the Kanban (from Lean Management) and Drum-Buffer-Rope (DBR, from the Theory of Constraints) scheduling mechanisms and evaluate their performance in a four-echelon supply chain operating within a large noise scenario. Through an agent-based system, which is presented as a powerful model-driven decision support system for managers, we show the less sensitivity against variability and the higher financial performance of the DBR mechanism, which occurs as this mechanism improves the supply chain robustness due to its bottleneck orientation. Nonetheless, we prove the existence of regions in the decision space where Kanban offers similar performance. This is especially relevant taking into account that Kanban can be implemented at a lower cost, as TOC requires a higher degree of information transparency and a solid contract between partners to align incentives. In this sense, we offer decision makers an approach to reach an agreement when the partners decide to move from Kanban to DBR in a bid to increase the overall net profit in supply chains operating in a challenging noise scenario

Computational Intelligence Application in Electrical Engineering

The Special Issue "Computational Intelligence Application in Electrical Engineering" deals with the application of computational intelligence techniques in various areas of electrical engineering. The topics of computational intelligence applications in smart power grid optimization, power distribution system protection, and electrical machine design and control optimization are presented in the Special Issue. The co-simulation approach to metaheuristic optimization methods and simulation tools for a power system analysis are also presented. The main computational intelligence techniques, evolutionary optimization, fuzzy inference system, and an artificial neural network are used in the research presented in the Special Issue. The articles published in this issue present the recent trends in computational intelligence applications in the areas of electrical engineering