SCOPUS 정보 검색 플랫폼

Volumn 36, Issue 9-10, 2000, Pages 673-692

Single machine scheduling with deadlines and increasing rates of processing times

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034349899 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050170 Document Type: Article

Times cited : (31)

References (11)

1
- 0025429963
- Scheduling deteriorating jobs on a single process
- 1. S. Browne, U. Yechiali, Scheduling deteriorating jobs on a single process, Oper Res 38, 495-498 (1990)
- (1990) Oper Res , vol.38 , pp. 495-498
- Browne, S.¹ Yechiali, U.²

2
- 0032093744
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
- 2. T.C.E. Cheng, Q. Ding, The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times, Comput Math Appl 35, 95-100 (1998)
- (1998) Comput Math Appl , vol.35 , pp. 95-100
- Cheng, T.C.E.¹ Ding, Q.²

3
- 0033166178
- The time dependent machine makespan problem is strongly NP-complete
- 3. T.C.E. Cheng, Q. Ding, The time dependent machine makespan problem is strongly NP-complete, Comput Oper Res 26, 749-754 (1999)
- (1999) Comput Oper Res , vol.26 , pp. 749-754
- Cheng, T.C.E.¹ Ding, Q.²

4
- 0028449763
- Resource optimal control in some single-machine scheduling problem
- 4. T.C.E. Cheng, A. Janiak, Resource optimal control in some single-machine scheduling problem, IEEE Trans Autom Control 39, 1243-1246 (1994)
- (1994) IEEE Trans Autom Control , vol.39 , pp. 1243-1246
- Cheng, T.C.E.¹ Janiak, A.²

5
- 74849101820
- Optimization and approximation in deterministic sequencing and scheduling: A survey
- 5. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann Discrete Math 5, 287-326 (1976)
- (1976) Ann Discrete Math , vol.5 , pp. 287-326
- Graham, R.L.¹ Lawler, E.L.² Lenstra, J.K.³ Rinnooy Kan, A.H.G.⁴

6
- 0003603813
- New York: Freeman
- 6. M.R. Garey, D.D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: Freeman 1979
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.D.²

7
- 0024137249
- Single facility scheduling with nonlinear processing times
- 7. J.N.D. Gupta, S.K. Gupta, Single facility scheduling with nonlinear processing times, Comput Industrial Eng 14, 387-393 (1998)
- (1998) Comput Industrial Eng , vol.14 , pp. 387-393
- Gupta, J.N.D.¹ Gupta, S.K.²

8
- 0027885153
- Complexity of scheduling tasks with time-dependent execution times
- 8. K.I-J. Ho, J.Y.-T. Leung, W-D. Wei, Complexity of scheduling tasks with time-dependent execution times, Inform Process Lett 48, 315-320 (1993)
- (1993) Inform Process Lett , vol.48 , pp. 315-320
- Ho, K.I.-J.¹ Leung, J.Y.-T.² Wei, W.-D.³

9
- 0026258725
- V-shaped polices to schedule deteriorating jobs
- 9. G. Mosheiov, V-shaped polices to schedule deteriorating jobs, Oper Res 39, 979-991 (1991)
- (1991) Oper Res , vol.39 , pp. 979-991
- Mosheiov, G.¹

10
- 0028463787
- Scheduling jobs under simple linear deterioration
- 10. G. Mosheiov, Scheduling jobs under simple linear deterioration, Comput Oper Res 21, 653-659 (1994)
- (1994) Comput Oper Res , vol.21 , pp. 653-659
- Mosheiov, G.¹

11
- 0028533158
- Single machine scheduling with start time dependent processing times: Some solvable cases
- 11. P.S. Sundararaghavan, A.S. Kunnathur, Single machine scheduling with start time dependent processing times: some solvable cases, Eur J Oper Res 78, 394-403 (1994)
- (1994) Eur J Oper Res , vol.78 , pp. 394-403
- Sundararaghavan, P.S.¹ Kunnathur, A.S.²

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