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.
The RCMPSPTT (resource-constrained multi-project scheduling problem with resource transfer time) problem usually exists in distributed collaborative manufacturing systems, in which scarce resources are shared by different projects dispersed in distributed physical places. Resources are needed to be transferred among different projects with non-neglectable time. In this paper, a hybrid genetic algorithm...
The no-wait job shop problem that exists with makespan minimization is well known to be a strongly NP-hard problem. In this paper, the properties of the problem are analyzed according to its characteristics. The problem is remodeled based on the introduced time difference. A traditional framework is adopted by decomposing the problem into two subproblems: the sequencing and the timetabling problems...
There is an improved algorithm of the matching of prefix and suffix BM strings is proposed. The algorithm becomes more efficient by combining the prefix and the location information of the next character of the current window, trying more location movements with the existing information. Experiments show that this algorithm is better than BM algorithm. Furthermore, an algorithm of subjective items...
This article did some innovations and exploration in the planning and exploiting course of individuation study system: in the subjective judgment module, we present the prefix and suffix BM algorithm. This algorithm imported the prefix comparative thought and the next character's information in QS algorithm, and when there are no matched characters in the matching course from right to left, it will...
No-wait flowshops with flowtime minimization are typical NP-complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in this paper by which the objective of an offspring being obtained just by objective increments and computational...
In this paper, NP-hard no-wait flowshop scheduling problems with makespan minimization are considered. An iterative local search method is proposed which performs a randomized walk in the space of local optima until some stop criterion is satisfied. A perturbation mechanism and a compound neighborhood operator (or move ) are presented. The proposal is compared with the best algorithm so far. Experimental...
In the paper, the no-wait job shop problem with makespan minimization is considered, which is decomposed into the sequencing problem and the timetabling problem. Based on the non-delay timetabling procedure and the inverse timetabling procedure, an enhanced timetabling procedure is constructed by shifting jobs leftwards or rightwards to obtain better timetables. The two sub-problems are solved independently...
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.