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 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, a hybrid genetic-VNS algorithm is proposed for the no-wait flowshop problem with total flowtime minimization. To avoid pitfalls of GA, such as poor local search capability and premature convergence, a rather effective VNS local search is introduced based on the framework of the improved GA. To fast convergence of the algorithm, ICH2 (an efficient composite heuristic) is used for the...
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...
In this paper, a Web Service based method is presented to conduct parallelized operations in an algorithm on multiple computers. Parallelizable operations in a constructive heuristic for flow shop scheduling problem with total flowtime minimization are analyzed. A parallel heuristic for the problem is described and its parameters are analyzed in theory. The proposed parallel heuristic is compared...
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...
In this paper, an objective increment method is introduced for no-wait flow shops with makespan minimization, which can calculate makespan of a new schedule directly from that of its parent and can judge whether the new schedule is better than its parent or not. Specific makespan increments are analyzed for insertion and pair-wise exchange, two fundamental operations in most heuristics for flow shops...
In this paper, a composite algorithm is proposed by integrating FL (described by Framinan and Leisten, OMEGA, 2003) with LW (presented by X.P. Li & C. Wu, Chinese Journal of Electronics, 2005) for large flow shop scheduling problem with total completion-time minimization, in which INSERT and SWAP (introduced by X.P. Li et al., Tsinghua Science and Technology, 2006) are adopted to reduce CPU-time...
According to QoS (quality of service) of computing resources in grid, a 2-tier hybrid algorithm is proposed for independent tasks scheduling with time-cost minimization. QGMM (QoS Guided Min-Min, presented by He Xiao Shan et al., Journal of Computer Science and Technology, 2003) is adopted in the first level to obtain a schedule with optimized completion time. A GA (genetic algorithm) only with mutation...
In this paper, we propose a new and rather simple grouped-subcarrier allocation algorithms with proportional fairness among users in downlink OFDM transmission. The proposed algorithm tries to minimize the required transmit power while satisfying the rate requirement and BER constraint of each user. Subcarrier and power allocation are performed in two steps. We are mainly focusing on the subcarrier...
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.