Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference22 articles.
1. Factorization and job scheduling: A connection via companion based matrix functions;Bart;Linear Algebra and Its Applications,1996
2. Variants of the two machine flow shop problem connected with factorization of matrix functions;Bart;European Journal of Operational Research,1996
3. Minimizing total tardiness on one machine is NP-hard;Du;Mathematics of Operations Reseach,1990
4. A faster algorithm for the maximum weighted tardiness problem;Fields;Information Processing Letters,1990
5. M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979