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.
We consider the problem of minimising the makespan in an m-machine flow shop subject to release dates and delivery times which requires scheduling n jobs through m machines which are placed in series. This problem is known to be NP-hard. We propose a new branch-and-bound algorithm which encompasses several features including a procedure for adjusting heads and tails, heuristics, and a lower bounding...
We consider the classical permutation flow shop problem which requires scheduling n jobs through m machines which are placed in series so as to minimize the makespan. This problem is known to be NP-hard. We describe a branch-and-bound algorithm with a lower bounding procedure based on the so-called two-machine flow shop problem with time lags, ready times, and delivery times. We present extensive...
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.