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, we consider the CRT problem for real numbers with noisy remainders that follow wrapped Gaussian distributions. We propose the maximum likelihood (ML) estimation based CRT when the remainder noises may not necessarily have the same variances. The proposed algorithm only needs to search for the solution among L elements, where L is the number of remainders. We compare the performances...
In this paper, the m-machine no-wait flowshop scheduling problem with sequence-dependent setup times is considered to minimize the makespan. According to the problem characteristics, the increment properties of some fundamental operators of algorithms are analyzed. Two increment-based methods FSP (fittest swap points) and FMP (fittest move points) are constructed for fast evaluation on all algorithms...
In the paper, a similarity based ant-colony algorithm (SACO) is proposed for the permutation flowshop scheduling problems with total flowtime minimization, which is known as NP-hard. By applying the space mapping method which is testified to be reasonable, it is proved theoretically that the deposit factor rho has hardly impact on the ACO evolutionary availability, and rho = 0.5 is reasonable for...
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 this paper, a composite heuristic algorithm is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are well known NP-hard. Besides initialized by LR(n/m), solution of the proposal is developed by iteration of FPE or BPE alternatively. Perturbation is applied to escape from the local optimization when no improvement can be obtained during the development...
In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms...
In this paper, permutation flow shop scheduling problem with total flowtime minimization is considered. Two composite heuristics, CH1 and CH2, are proposed which use LR (developed by Liu & Reeves) as index development phase and iterative RZ+FPE-R procedure as solution improvement phase. CH2 also adopts FL to construct a solution. CH1 and CH2 are compared with FLR1, FLR2 and IH7_FL (the best existing...
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.