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 consider the problem of scheduling jobs with and without release dates on parallel unbounded batch processing machines to minimize total completion time. We show that the problem with release dates is strongly NP-hard by a reduction from the strongly NP-hard 3-Partition problem and develop a dynamic programming algorithm for the problem without release dates.
In this paper we provide a linear programming relaxation algorithm for scheduling problem with controllable processing times. This problem is NP-hard even if there are no precedence constraints between the jobs. We prove that the performance ratio of the algorithm is 4.
In this paper we prove that the problem of scheduling jobs with incompatible job families on a single batch processing machine to minimize number of tardy jobs is strongly (unary) NP-hard. We then develop a dynamic programming algorithm for minimizing weighted number of tardy jobs on a single batch processing machine with incompatible job families.
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.