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, the manufacturing process in iron and steel manufacturing systems is modeled as the m-machine no-wait flowshop scheduling problem with sequence-dependent setup times. To avoid extreme uneven utilization of machine capacity, makespan is considered as the minimization criterion. An adaptive intelligent method named GEIM is proposed, which is a new meta-heuristic on the basis of greedy...
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 this paper, no-wait flow shop scheduling problem with flowtime minimization is considered. Objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional...
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...
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.