SCOPUS 정보 검색 플랫폼

Operations Research

Volumn 46, Issue 5, 1998, Pages 742-746

Resource constrained chain scheduling of uet jobs on two machines

(5) Kubiak, W a BLazewicz J b Dror, M c Katoh, N d Rock, H e

a MEMORIAL UNIVERSITY OF NEWFOUNDLAND (Canada)

b POZNAN UNIVERSITY OF TECHNOLOGY (Poland)

c UNIVERSITY OF ARIZONA (United States)

d UNIVERSITY OF HYOGO (Japan)

e UNIVERSITY OF ROSTOCK (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPERATIONS RESEARCH; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION;

MAXIMUM CARDINALITY MATCHINGS; PARALLEL PROCESSORS; POLYNOMIAL ALGORITHMS; RESOURCE CONSTRAINED CHAIN SCHEDULING; UNIT EXECUTION TIME JOBS;

SCHEDULING;

EID: 0032154623 PISSN: 0030364X EISSN: None Source Type: Journal
DOI: 10.1287/opre.46.5.742 Document Type: Article

Times cited : (1)

References (9)

1
- 0003638428
- J. C. Baltzer, Basel, Germany
- BLAŻEWICZ, J., W. CELLARY, R. SLOWIŃSKI, AND J. WȨGLARZ. 1987. Scheduling Under Resource Constraints Deterministic Models. J. C. Baltzer, Basel, Germany.
- (1987) Scheduling under Resource Constraints Deterministic Models
- Blazewicz, J.¹ Cellary, W.² Slowiński, R.³ Wȩglarz, J.⁴

2
- 0004048738
- Springer Verlag, Berlin and New York
- BLAŻEWICZ, J., K. ECKER, G. SCHMIDT, AND J. WȨGLARZ. 1993. Scheduling in Computer and Manufacturing Systems. Springer Verlag, Berlin and New York.
- (1993) Scheduling in Computer and Manufacturing Systems
- Blazewicz, J.¹ Ecker, K.² Schmidt, G.³ Wȩglarz, J.⁴

3
- 0019342681
- Scheduling subject to resource constraints: Classification and complexity
- BLAŻEWICZ, J., J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1983. Scheduling Subject to Resource Constraints: Classification and Complexity. Discrete Appl. Math. 5, 11-24.
- (1983) Discrete Appl. Math. , vol.5 , pp. 11-24
- Blazewicz, J.¹ Lenstra, J.K.² Rinnooy Kan, A.H.G.³

4
- 0014534836
- Optimal sequencing of two equivalent processors
- FUJII, M., T. KASAMI, AND K. NINOMIYA. 1969. Optimal Sequencing of Two Equivalent Processors. SLAM J. Appl. Math. 17, 784-789.
- (1969) SLAM J. Appl. Math. , vol.17 , pp. 784-789
- Fujii, M.¹ Kasami, T.² Ninomiya, K.³

5
- 0001627504
- Complexity results for multiprocessor scheduling under resource constraints
- GAREY, M. R. AND D. S. JOHNSON. 1975. Complexity Results for Multiprocessor Scheduling Under Resource Constraints. SIAM J. Comput. 4, 397-411.
- (1975) SIAM J. Comput. , vol.4 , pp. 397-411
- Garey, M.R.¹ Johnson, D.S.²

6
- 74849101820
- Optimization and approximation in deterministic sequencing and scheduling theory: A survey
- GRAHAM, R. L., E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling Theory: A Survey. Ann. Discrete Math. 5, 287-326.
- (1979) Ann. Discrete Math. , vol.5 , pp. 287-326
- Graham, R.L.¹ Lawler, E.L.² Lenstra, J.K.³ Rinnooy Kan, A.H.G.⁴

7
- 84986936651
- 2.5) algorithm for maximum matching in general graphs
- 2.5) Algorithm for Maximum Matching in General Graphs. Sixteenth Annual Symposium on Foundations of Computer Science, IEEE, 100-112.
- (1975) Sixteenth Annual Symposium on Foundations of Computer Science, IEEE , pp. 100-112
- Kariv, O.¹ Even, S.²

8
- 17144427932
- Unpublished Result
- ROCK, H. 1984. Unpublished Result.
- (1984)
- Rock, H.¹

9
- 17144384613
- Unpublished Result
- WARMUTH, M. 1984. Unpublished Result.
- (1984)
- Warmuth, M.¹

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