SCOPUS 정보 검색 플랫폼

Volumn 28, Issue 5, 2001, Pages 205-212

On preemption redundancy in scheduling unit processing time jobs on two parallel machines

a CNRS (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROCESS ENGINEERING; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING; STRATEGIC PLANNING; THEOREM PROVING;

MC NAUGHTON THEOREM;

OPERATIONS RESEARCH;

EID: 0035362830 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/S0167-6377(01)00068-2 Document Type: Article

Times cited : (17)

References (11)

1
- 84891459569
- Springer, Heidelberg
- (1998) Scheduling Algorithms
- Brucker, P.¹

3
- 0002957133
- A review of machine scheduling: Complexity, algorithms and approximability
- D.-Z. Du, P.M. Pardalos (Eds.), Kluwer Academic Publishers, Dordrecht
- (1998) Handbook of Combinatorial Optimization , pp. 21-169
- Chen, B.¹ Potts, C.N.² Woeginger, G.J.³

5
- 0026170095
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- (1991) Inform. Comput. , vol.92 , pp. 219-236
- Du, J.¹ Leung, J.Y.-T.² Young, G.H.³

6
- 0001430010
- Parallel sequencing and assembly line problems
- (1961) Oper. Res. , vol.9 , pp. 841-848
- Hu, T.C.¹

7
- 0345901561
- Sequencing and scheduling: Algorithms and complexity
- S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (Eds.), Elsevier, Amsterdam
- (1993) Handbook on Operations Research and Management Science , pp. 445-552
- Lawler, E.L.¹ Lenstra, J.K.² Rinnooy Kan, A.H.G.³ Shmoys, D.B.⁴

8
- 0002643827
- Scheduling with deadlines and loss functions
- (1959) Management Sci. , vol.6 , pp. 1-12
- McNaughton, R.¹

10
- 0004671521
- Technical Report, Department of Computing and Software, McMaster University, Hamilton, Ontario
- (1998) Identical parallel machines vs. unit-time shops and preemption vs. chains in scheduling complexity
- Timkovsky, V.G.¹

11
- 0004708371
- Is a unit-time job shop not easier than identical parallel machines?
- (1998) Discrete Appl. Math. , vol.85 , pp. 149-162
- Timkovsky, V.G.¹

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