The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the past decades, divisible load scheduling has become an increasingly concerned field in the research of computer science. At the same time, the total system cost of data center has received worldwide attention, and the concept of green computing has been put forward. This paper investigates an cost-efficient divisible load scheduling using genetic algorithm. It focuses on finding an efficient...
Job shop scheduling problem is a typical NP-hard problem. In this paper, new designed crossover and mutation operators based on the characteristic of the job shop problem itself are specifically designed. Based on these, an improved genetic algorithm is proposed. The computer simulations are made on a set of benchmark problems and the results indicate the effectiveness of the proposed algorithm.
The paper focuses on a special nonlinear bilevel programming problem (BLPP), and its characteristic is that the follower's programming is convex and quadratic, whereas there are no any additional requirements for the leader's functions. In order to solve the complex problem efficiently, it is first converted into an equivalent single-level programming by using Karush-Kuhn-Tucher (K-K-T) conditions,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.