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 investigates the problem of minimizing makespan for the distributed assembly permutation flowshop scheduling problem (DAPFSP)-a new generalization of the distributed permutation flowshop scheduling problem (DPFSP). DAPFSP consists of two stages: production and assembly. The first stage is production at several identical factories. Each factory is a permutation flowshop scheduling problem...
The permutation flow shop problem (PFSSP) is a well-known difficult combinatorial optimization problem. In this paper, we present a new hybrid optimization algorithm named SIGSA to solve the PFSSP. This algorithm is composed by the LRV rule, SA-based local search and IIS-based local search. First, to make GSA suitable for PFSSP, a new LRV rule based on random key is introduced to convert the continuous...
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.