1 T j NP hard in the ordinary sense There is a pseudo polynomial time algorithm to solve the problem Properties of the solution If p j p k and d j d k holds then there exists an optimal sequence in which job j is scheduled before job k ID: 448240
Download Presentation The PPT/PDF document "Total Tardiness (1)" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
