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.
This paper examines the uniform parallel-machine scheduling problem in which the objective aims to minimize the total resource consumption (TRC) with a bounded makespan. A matheuristic is proposed to deal with this strongly NP-hard problem. The performance of the proposed matheuristic is compared with that of the state-of-the-art particle swarm optimization (PSO) meta-heuristic and the lower bound...
We consider in this paper the two-machine ftow-shop scheduling problem with total tardiness minimization. We propose a genetic algorithm and a matheuristic algorithm. Some computational experiments are described and the results show that these methods outperform other existing methods based on truncated branch-and-bound algorithms. Some future research directions are given, both in terms of evaluation...
This paper studies the earliness and tardiness scheduling problem on the single machine with fuzzy processing times. A new membership function of the fuzzy processing times is established. Under some assumptions, the E/T scheduling model with fuzzy processing time is formulated, and a criterion to rank the different fuzzy schemes is also presented. Since the problem is a NP-hard problem, Genetic algorithms...
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.