V. G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in The 1st All-Union Consultation on Statistical and Discrete Analysis of NonNumerical Information, on Expert Estimates and Discrete Optimization (Yu. N. Turin, ed.), Kazakh State University, Moscow--Alma-Ata, 1981, pp. 220--221. (in Russian) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Scheduling Cycle Shops: Classification, Complexity And.. - Middendorf, Timkovsky Self-citation (Timkovsky) (Correct)
....RF3jr j ; p oj = 1j P C j strongly [K99] RF3kBmax strongly [HKS98] R1 2;6F3kBmax strongly [HKS98] R1 2;6F3jno waitjBmax strongly [AP98] R1F jn = 1jP strongly [LW89,BFK97] R1F jn = 1; po ]jP strongly [CK97A] RF jn = 1; po = qo ; pe = 1jCmax strongly [Section 5. 3] C2jp ij 2 f1; 2gjCmax strongly [T81] C2jno wait; chains; p ij = 1j P w j C j strongly [Section 4.3] C2jno wait; chains; p ij = 1j P T j strongly [Section 4.3] C2jno wait; chains; p ij = 1j P U j strongly [Section 4.3] Cjno wait; intree; r j ; p ij = 1j P C j strongly [Section 4.3] Cjno wait; intree; r j ; p ij = 1jCmax ....
V. G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in The 1st All-Union Consultation on Statistical and Discrete Analysis of NonNumerical Information, on Expert Estimates and Discrete Optimization (Yu. N. Turin, ed.), Kazakh State University, Moscow--Alma-Ata, 1981, pp. 220--221. (in Russian)
On Scheduling Cycle Shops: Classification, Complexity And.. - Middendorf, Timkovsky Self-citation (Timkovsky) (Correct)
....RF3jr j ; p oj = 1j P C j strongly [K99] RF3kBmax strongly [HKS98] R1 2;6F3kBmax strongly [HKS98] R1 2;6F3jno waitjBmax strongly [AP98] R1F jn = 1jP strongly [LW89,BFK97] R1F jn = 1; po ]jP strongly [CK97A] RF jn = 1; po = q o ; pe = 1jCmax strongly [Section 4. 3] C2jp ij 2 f1; 2gjCmax strongly [T81] C2jno wait; chains; p ij = 1j P w j C j strongly [Section 3.2] C2jno wait; chains; p ij = 1j P T j strongly [Section 3.2] C2jno wait; chains; p ij = 1j P U j strongly [Section 3.2] Cjno wait; intree; r j ; p ij = 1j P C j strongly [Section 3.2] Cjno wait; intree; r j ; p ij = 1jCmax ....
V. G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in The 1st All-Union Consultation on Statistical and Discrete Analysis of NonNumerical Information, on Expert Estimates and Discrete Optimization (Yu. N. Turin, ed.), Kazakh State University, Moscow{Alma-Ata, 1981, pp. 220-221. (in Russian)
Is A Unit-Time Job Shop Not Easier Than Identical Parallel.. - Timkovsky (1998) (3 citations) Self-citation (Timkovsky) (Correct)
....is a polynomialtime algorithm for Cjp ij = 1=s i jC max nding a schedule with the performance ratio 1 (3m h) n [T86] where h is the number of operations in each job. Besides, C2jp ij 2 f1; 2gjC max , a restricted version of the strongly NP hard J2jp ij 2 f1; 2gjC max [LRK79] is also so [T81]. Table 1. Problems solvable in polynomial time Cjp ij = 1jC max [T85] C2jp ij = 1=s i jC max [T85] J2jr j ; p ij = 1jC max [T93] T97] J2jp ij = 1j C j [KT96] J2jp ij = 1j U j [K96A] J2jno wait; p ij = 1j C j [K96B] J jprec; r j ; n n; p ij = 1j w j T j [BK96] J jprec; r j ; n ....
V. G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in The 1st All-Union Consultation on Statistical and Discrete Analysis of NonNumerical Information, on Expert Estimates and Discrete Optimization (Yu. N. Turin, ed.), Kazakh State University, Moscow{Alma-Ata, 1981, pp. 220-221. (in Russian)
Is A Unit-Time Job Shop Not Easier Than Identical Parallel.. - Timkovsky (1998) (3 citations) Self-citation (Timkovsky) (Correct)
....result is a polynomialtime algorithm for Cjp ij = 1=s i jC max finding a schedule with the performance ratio 1 (3m h) n [T86] where h is the number of operations in each job. Besides, C2jp ij 2 f1; 2gjC max , a restricted version of the strongly NP hard J2jp ij 2 f1; 2gjC max [LRK79] is also so [T81]. Table 1. Problems solvable in polynomial time Cjp ij = 1jC max [T85] C2jp ij = 1=s i jC max [T85] J2jr j ; p ij = 1jC max [T93] T97] J2jp ij = 1j SigmaC j [KT96] J2jp ij = 1j SigmaU j [K96A] J2jno wait; p ij = 1j SigmaC j [K96B] J jprec; r j ; n n; p ij = 1j Sigmaw j T j [BK96] J ....
V. G. Timkovsky, Computational complexity and approximation of the cycle shop scheduling problem, in The 1st All-Union Consultation on Statistical and Discrete Analysis of NonNumerical Information, on Expert Estimates and Discrete Optimization (Yu. N. Turin, ed.), Kazakh State University, Moscow--Alma-Ata, 1981, pp. 220--221. (in Russian)
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