SCOPUS 정보 검색 플랫폼

Volumn 21, Issue 2, 1997, Pages 77-80

Batch scheduling to minimize maximum lateness

a NONE

Author keywords

Analysis of algorithms; Dynamic programming; Production scheduling

Indexed keywords

EID: 0009628229 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/S0167-6377(97)00028-X Document Type: Article

Times cited : (40)

References (13)

2
- 0000612586
- Complexity of task sequencing with deadlines, set-up times and changeover costs
- J. Bruno, P. Downey, Complexity of task sequencing with deadlines, set-up times and changeover costs, SIAM J. Comput. 7 (1978) 393-404.
- (1978) SIAM J. Comput. , vol.7 , pp. 393-404
- Bruno, J.¹ Downey, P.²

3
- 0001184498
- Task sequencing in a batch environment with setup times
- J. Bruno, R. Sethi, Task sequencing in a batch environment with setup times, Found. Control Eng. 3 (1978) 105-117.
- (1978) Found. Control Eng. , vol.3 , pp. 105-117
- Bruno, J.¹ Sethi, R.²

4
- 0004127488
- Freeman, New York
- M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
- (1979) Computers and Intractability
- Garey, M.R.¹ Johnson, D.S.²

5
- 0028753689
- Batch scheduling to minimize total completion time
- J.B. Ghosh, Batch scheduling to minimize total completion time, Oper. Res. Lett. 16 (1994) 271-275.
- (1994) Oper. Res. Lett. , vol.16 , pp. 271-275
- Ghosh, J.B.¹

6
- 0024736520
- On the complexity of scheduling with batch setup times
- C.L. Monma, C.N. Potts, On the complexity of scheduling with batch setup times, Oper. Res. 37 (1989) 798-804.
- (1989) Oper. Res. , vol.37 , pp. 798-804
- Monma, C.L.¹ Potts, C.N.²

7
- 0025857797
- Scheduling two job classes on a single machine
- C.N. Potts, Scheduling two job classes on a single machine, Comput. Oper. Res. 18 (1991) 411-415.
- (1991) Comput. Oper. Res. , vol.18 , pp. 411-415
- Potts, C.N.¹

8
- 84974861854
- Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity
- C.N. Potts, L.N. Van Wassenhove, Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, J. Oper. Res. Soc. 43 (1992) 395-406.
- (1992) J. Oper. Res. Soc. , vol.43 , pp. 395-406
- Potts, C.N.¹ Van Wassenhove, L.N.²

9
- 0030215229
- Single-machine scheduling with release dates, due dates and family setup times
- J.M.J. Schutten, S.L. van de Velde, W.H.M. Zijm, Single-machine scheduling with release dates, due dates and family setup times, Management Sci. 42 (1996) 1165-1174.
- (1996) Management Sci. , vol.42 , pp. 1165-1174
- Schutten, J.M.J.¹ Van De Velde, S.L.² Zijm, W.H.M.³

10
- 0002436722
- Batch sequencing
- A.T. Unal, A.S. Kiran, Batch sequencing, IIE Trans. 24 (1992) 73-83.
- (1992) IIE Trans. , vol.24 , pp. 73-83
- Unal, A.T.¹ Kiran, A.S.²

11
- 0029338650
- Scheduling groups of jobs on a single machine
- S. Webster, K.R. Baker, Scheduling groups of jobs on a single machine, Oper. Res. 43 (1995) 692-703.
- (1995) Oper. Res. , vol.43 , pp. 692-703
- Webster, S.¹ Baker, K.R.²

12
- 0026121255
- Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
- S. Zdrzalka, Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times, European J. Oper. Res. 51 (1991) 199-209.
- (1991) European J. Oper. Res. , vol.51 , pp. 199-209
- Zdrzalka, S.¹

13
- 0029183195
- Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
- S. Zdrzalka, Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times, European J. Oper. Res. 80 (1995) 371-380.
- (1995) European J. Oper. Res. , vol.80 , pp. 371-380
- Zdrzalka, S.¹

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