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 considers the two-machine flow shop scheduling problem to minimize the sum of completion times. We design two heuristic algorithms, Triangle Shortest Processing Time first (TSPT) and Dynamic Triangle Shortest Processing Time first (DTSPT), for problems F2∥ΣCj and F2|rj|ΣCj respecttively. Moreover, to further evaluate the heuristics numerically, two new lower bounds with performance guarantee...
In the paper, we consider the flow shop makespan problem with release dates. A new lower bound of the problem is presented. The new lower bound is asymptotically equivalent to the optimality solution, when the size of the problem goes to infinity. And a tight worst case performance ratio, m, of the optimal solution to the new lower bound is obtained. Specially, when the processing times of jobs are...
This paper considers a new problem of scheduling hot jobs with nonlinear temperature drop curve which is more approximate to the real situation than linear temperature drop curve to minimize the total temperature drop loss. In the problem, all jobs have the same temperature drop curve and different processing times. In this paper, two cases of problems are studied. (1) For the case of jobs without...
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.