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.
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution with traditional optimization approaches. An improved genetic algorithm combined with tabu search is proposed to solve...
To exploit the power of modern heterogeneous multiprocessor embedded platforms on partitioned applications, the designer usually needs to efficiently map and schedule all the tasks and the communications of the application, respecting the constraints imposed by the target architecture. Since the problem is heavily constrained, common methods used to explore such design space usually fail, obtaining...
Quality-of-Service Multicast routing is a well-known NP-complete problem as constrained Steiner tree problem, which has various real-time multimedia applications in highspeed networks. The bandwidth-delay-constrained least-cost multicast routing algorithms based on Tabu Search are proposed in this paper. These algorithms can improve the search speed, and make a better solution by using one of the...
In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these heuristics are quite effective to solve the problem, they suffer from the need to optimize parameters. The proposed heuristic, named STLS, has a single self-tuning parameter which is...
Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search...
This paper describes a new design of Tabu search (ts) algorithm for solving the vehicle routing problem with time windows (VRPTW). Since VRPTW is a well known NP-hard problem, heuristic algorithms such as Tabu search are always used to get a good approach. The former published designs of TS usually focus on the neighbor structure, the relaxation to the objective function or the multi-period algorithms...
This paper concerns tabu search approach for solving two-layer networks design problem. We present a modular case of two-layer network dimensioning in networks with non-bifurcated flows, what cause stated problem NP complete. Hardness of presented problem makes it impossible (for large networks) to attain optimal results with deterministic methods. An estimate solution may be reachable in satisfying...
In recent time we spot a tendency to use the computing capacity of workstation clusters instead of investing in single machines with tremendous calculation power. Applying this idea we are able to execute multiple jobs paralelly. However, it still remains unclear how to schedule given jobs among available machines most effectively. Therefore this paper is an approach to optimization of mentioned scheduling...
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.