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 this paper, a filter and fan method is proposed for the single-machine tardiness scheduling problem with sequence-dependent setups, which is a typical NP-hard combinational optimization problem. The method searches the solution space by means of neighborhood search tree and the tree branches are extended by predefined moves. To enhance the algorithm ability of escaping from local optima, kick strategy...
The problem of NC equipments resource scheduling in grid system is a NP-hard difficulty, to overcome which this paper proposes the conflict dissolution tactics. First, the technical differences between the grid schedule and the general Job-Shop problem is illustrated. Second, the tactics of conflict dissolution are represented using some complex formula derivation. Finally, the steps for searching...
Ant colony optimization (ACO) converges on the optimal path with pheromones cumulating and updating, adopting the mechanism of distributed parallel search. Ant colony system is well self-adaptive and dynamic with making full use of current feedback, which is similar to the dynamic performance of the grid and is proved to be an effective algorithm to solve scheduling problems. But the existing ant...
In this paper we address a bi-criteria hybrid flow shop scheduling problem consisting in the earliness and tardiness penalties with different job due dates. This problem is proven to be NP-hard, and consequently the development of heuristic and meta-heuristic approaches to solve it is well justified. So, we propose an ant colony optimization method based on the ant colony system (ACS) to deal with...
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.