SCOPUS 정보 검색 플랫폼

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 305-308

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

(2) Gawiejnowicz, Stanisław a Kononov, Alexander b

a ADAM MICKIEWICZ UNIVERSITY (Poland)

b SOBOLEV INSTITUTE OF MATHEMATICS (Russian Federation)

Author keywords

Complexity theory; Deteriorating jobs; Fully polynomial time approximation scheme; Scheduling

Indexed keywords

APPROXIMABILITY; COMPLETION TIME; COMPLEXITY THEORY; DECISION VERSION; DETERIORATING JOBS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; FULLY POLYNOMIAL-TIME APPROXIMATION SCHEME; NP COMPLETE; OPTIMALITY; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; SINGLE MACHINES;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DETERIORATION;

POLYNOMIAL APPROXIMATION;

EID: 69249233599 PISSN: 03772217 EISSN: None Source Type: Journal
DOI: 10.1016/j.ejor.2008.12.014 Document Type: Article

Times cited : (55)

References (8)

1
- 0141859880
- A concise survey of scheduling with time-dependent scheduling times
- Cheng T.-C.E., Ding Q., and Lin B.M.-T. A concise survey of scheduling with time-dependent scheduling times. European Journal of Operational Research 152 1 (2004) 1-13
- (2004) European Journal of Operational Research , vol.152 , Issue.1 , pp. 1-13
- Cheng, T.-C.E.¹ Ding, Q.² Lin, B.M.-T.³

2
- 33846302028
- Scheduling deteriorating jobs subject to machine or job availability constraints
- Gawiejnowicz S. Scheduling deteriorating jobs subject to machine or job availability constraints. European Journal of Operational Research 180 1 (2007) 472-478
- (2007) European Journal of Operational Research , vol.180 , Issue.1 , pp. 472-478
- Gawiejnowicz, S.¹

3
- 69249218790
- Springer, Berlin/Heidelberg
- Gawiejnowicz S. Time-Dependent Scheduling (2008), Springer, Berlin/Heidelberg
- (2008) Time-Dependent Scheduling
- Gawiejnowicz, S.¹

4
- 33748547219
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Ji M., He Y., and Cheng T.-C.E. Scheduling linear deteriorating jobs with an availability constraint on a single machine. Theoretical Computer Science 362 1-3 (2006) 115-126
- (2006) Theoretical Computer Science , vol.362 , Issue.1-3 , pp. 115-126
- Ji, M.¹ He, Y.² Cheng, T.-C.E.³

5
- 49049130359
- The NP-completeness column: An ongoing guide
- Johnson D.S. The NP-completeness column: An ongoing guide. Journal of Algorithms 2 4 (1982) 393-405
- (1982) Journal of Algorithms , vol.2 , Issue.4 , pp. 393-405
- Johnson, D.S.¹

6
- 84944560904
- Machine scheduling with availability constraints
- Leung J.Y.-T. (Ed), Chapman and Hall CRC, Boca Raton
- Lee C.-Y. Machine scheduling with availability constraints. In: Leung J.Y.-T. (Ed). Handbook of Scheduling (2004), Chapman and Hall CRC, Boca Raton
- (2004) Handbook of Scheduling
- Lee, C.-Y.¹

7
- 0007604993
- When does a dynamic programming formulation guarantee the existence of an FPTAS?
- Woeginger G. When does a dynamic programming formulation guarantee the existence of an FPTAS?. INFORMS Journal on Computing 12 1 (2000) 57-73
- (2000) INFORMS Journal on Computing , vol.12 , Issue.1 , pp. 57-73
- Woeginger, G.¹

8
- 0038517117
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- Wu C.-C., and Lee W.-C. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine. Information Processing Letters 87 2 (2003) 89-93
- (2003) Information Processing Letters , vol.87 , Issue.2 , pp. 89-93
- Wu, C.-C.¹ Lee, W.-C.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.