P. Baptiste, On minimizing the weighted number of late jobs in unit execution time open-shops, Technical Report, Universite de Technologie de Compiegne, France, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Preemptive Scheduling of Identical Machines - Baptiste (2000) Self-citation (Baptiste) (Correct)
....the number of machines is arbitrary, the problem is NP Hard again. In [4] it is shown that a closely related problem, where p = m and where jobs have release dates, is of great interest for solving the openshop scheduling problem with unit execution time known as Omjp ij = 1j P w i U i . In [2], a dynamic programming algorithm with time complexity O(n 4m 2 2m 10 ) is proposed to solve both Pmjpmtn; p i = m; r i j P w i U i and Omjp ij = 1j P w i U i . In this paper we propose a necessary and su cient condition of existence of a solution for P jpmtn; d i j that can be ....
Ph. Baptiste, On Minimizing the Weighted Number of Late Jobs in Unit Execution Time Open-Shops, Universit de Technologie de Compi gne (submitted).
Identical Parallel Machines Vs Unit-Time Shops And Preemptions.. - Timkovsky (2000) (Correct)
No context found.
P. Baptiste, On minimizing the weighted number of late jobs in unit execution time open-shops, Technical Report, Universite de Technologie de Compiegne, France, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC