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 study a production scheduling problem with production and assembly stages. There is a set of distributed identical factories, each one with a set of unrelated parallel machines at the production stage and a single assembly machine in the assembly stage. Jobs have to be assigned to one of the distributed factories and processed by one of the unrelated parallel machines. Processed jobs...
In real life due dates are intervals rather than points in time. In this paper we deal with hybrid flowshops where jobs do not incur in penalties if they are completed inside given due windows. The objective to minimize is the weighted earliness and tardiness from the given due window. We propose simple heuristics based on iterated greedy and iterated local search. We present some procedures: an optimal...
In this paper we study the unspecified unrelated parallel machine scheduling problem with additional resources. Jobs can be processed at any machine, using a certain number of units of a scarce resource. The objective is to schedule jobs in parallel machines, so that the makespan is minimized, and the use of resources does not exceed a given limit, at any time. We propose an ILP program to solve this...
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.