SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 169-188

Restrictions and preassignments in preemptive open shop scheduling

(4) De Werra, D a Hoffman, A J b Mahadev, N V R c Peled, U N d

a EPFL (Switzerland)

b IBM T J WATSON RESEARCH CENTER (United States)

c NORTHEASTERN UNIVERSITY (United States)

d UNIVERSITY OF ILLINOIS AT CHICAGO (United States)

Author keywords

Chromatic scheduling; Edge coloring; Open shop scheduling; Production; Timetabling

Indexed keywords

EID: 0040588576 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/0166-218X(95)00055-V Document Type: Article

Times cited : (16)

References (13)

1
- 0004225465
- Gauthier-Villars, Paris
- C. Berge, Graphes (Gauthier-Villars, Paris, 1983).
- (1983) Graphes
- Berge, C.¹

2
- 0004650626
- Balanced matrices
- C. Berge, Balanced Matrices, Math. Programming 2 (1972) 19-31.
- (1972) Math. Programming , vol.2 , pp. 19-31
- Berge, C.¹

3
- 0004048738
- Springer Verlag, Berlin
- J. Blazewicz, K. Ecker, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems (Springer Verlag, Berlin, 1983).
- (1983) Scheduling in Computer and Manufacturing Systems
- Blazewicz, J.¹ Ecker, K.² Schmidt, G.³ Weglarz, J.⁴

4
- 0003638428
- J.C. Baltzer, Basel
- J. Blazewicz, W. Cellary and R. Slowinski, Scheduling Resource Contraints: Deterministic Models (J.C. Baltzer, Basel, 1986).
- (1986) Scheduling Resource Contraints: Deterministic Models
- Blazewicz, J.¹ Cellary, W.² Slowinski, R.³

5
- 0041182669
- Edge-chromatic scheduling with simultaneity constraints
- D. de Werra, N.V.R. Mahadev and U.N. Peled, Edge-chromatic scheduling with simultaneity constraints, SIAM J. Discrete Math. (1993) 631-641.
- (1993) SIAM J. Discrete Math. , pp. 631-641
- De Werra, D.¹ Mahadev, N.V.R.² Peled, U.N.³

6
- 0001488083
- On the complexity of timetable and multicommodity flow problems
- S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comput. 5 (1976) 691-703.
- (1976) SIAM J. Comput. , vol.5 , pp. 691-703
- Even, S.¹ Itai, A.² Shamir, A.³

7
- 0000066026
- On balanced matrices
- D.R. Fulkerson, A. Hoffman and R. Oppenheim, On balanced matrices, Math. Progr. Study 1 (1974) 120-132.
- (1974) Math. Progr. Study , vol.1 , pp. 120-132
- Fulkerson, D.R.¹ Hoffman, A.² Oppenheim, R.³

8
- 0042080211
- IAOR Report 199, University of Fribourg
- H. Groeflin, Feasible Graph Coloring and a Generalization of Perfect Graphs, IAOR Report 199, University of Fribourg (1992).
- (1992) Feasible Graph Coloring and a Generalization of Perfect Graphs
- Groeflin, H.¹

9
- 51249185617
- The ellipsoid method and its consequences in combinatorial optimization
- M. Groetschel, L. Lovasz and A. Schrijver, The Ellipsoid method and its consequences in Combinatorial Optimization, Combinatorica 1 (1981) 169-197.
- (1981) Combinatorica , vol.1 , pp. 169-197
- Groetschel, M.¹ Lovasz, L.² Schrijver, A.³

10
- 0001009871
- 5/2 algorithm for maximum matching in bipartite graphs
- 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
- (1973) SIAM J. Comput. , vol.2 , pp. 225-231
- Hopcroft, J.E.¹ Karp, R.M.²

11
- 0346865623
- Some results concerning the complexity of restricted colorings of graphs
- M. Kubale, Some results concerning the complexity of restricted colorings of graphs. Discrete Appl. Math. 36 (1992) 35-46.
- (1992) Discrete Appl. Math. , vol.36 , pp. 35-46
- Kubale, M.¹

12
- 38249003803
- Interval edge coloring of a graph with forbidden colors
- M. Kubale, Interval edge coloring of a graph with forbidden colors, Discrete Math. 121 (1993) 135-143.
- (1993) Discrete Math. , vol.121 , pp. 135-143
- Kubale, M.¹

13
- 84917966758
- Non-separable and planar graphs
- H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc. 34 (1932) 339-362.
- (1932) Trans. Amer. Math. Soc. , vol.34 , pp. 339-362
- Whitney, H.¹

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