SCOPUS 정보 검색 플랫폼

Volumn 31, Issue 3-4, 2006, Pages 328-334

A simulated annealing approach to makespan minimization on identical parallel machines

Author keywords

Makespan; Parallel machines; Scheduling; Simulated annealing

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

HEURISTIC ALGORITHMS; MAKESPAN; PARALLEL MACHINES;

SIMULATED ANNEALING;

EID: 33751080722 PISSN: 02683768 EISSN: 14333015 Source Type: Journal
DOI: 10.1007/s00170-005-0188-5 Document Type: Article

Times cited : (64)

References (16)

1
- 0003438602
- Prentice-Hall, Upper Saddle River, New Jersey
- Pinedo M (2002) Scheduling: theory, algorithms, and systems. Prentice-Hall, Upper Saddle River, New Jersey
- (2002) Scheduling: Theory, Algorithms, and Systems
- Pinedo, M.¹

2
- 0035241046
- A LISTFIT heuristic for minimizing makespan on identical parallel machines
- Gupta JND, Ruiz-Torres AJ (2001) A LISTFIT heuristic for minimizing makespan on identical parallel machines. Prod Plan Control 12:28-36
- (2001) Prod Plan Control , vol.12 , pp. 28-36
- Gupta, J.N.D.¹ Ruiz-Torres, A.J.²

3
- 0003603813
- Freeman, San Francisco, California
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. Freeman, San Francisco, California
- (1979) Computers and Intractability: A Guide to the Theory of NP Completeness
- Garey, M.R.¹ Johnson, D.S.²

4
- 0014477093
- Bounds on multiprocessor timing anomalies
- Graham RL (1969) Bounds on multiprocessor timing anomalies. SIAM J Appl Math 17:416-429
- (1969) SIAM J Appl Math , vol.17 , pp. 416-429
- Graham, R.L.¹

5
- 0001923235
- An application of bin-packing to multiprocessor scheduling
- Coffman EG, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7:1-17
- (1978) SIAM J Comput , vol.7 , pp. 1-17
- Coffman, E.G.¹ Garey, M.R.² Johnson, D.S.³

6
- 0021374487
- Tighter bounds for the multifit processor scheduling algorithm
- Friesen DK (1984) Tighter bounds for the multifit processor scheduling algorithm. SIAM J Comput 13:170-181
- (1984) SIAM J Comput , vol.13 , pp. 170-181
- Friesen, D.K.¹

7
- 15344349285
- On the exact upper bound for the MULTIFIT processor algorithm
- Yue M (1990) On the exact upper bound for the MULTIFIT processor algorithm. Ann Oper Res 24:233-259
- (1990) Ann Oper Res , vol.24 , pp. 233-259
- Yue, M.¹

8
- 0024051185
- Multiprocessor scheduling: Combining LPT and MULTIFIT
- Lee CY, Massey JD (1988) Multiprocessor scheduling: combining LPT and MULTIFIT. Discrete Appl Math 20:233-242
- (1988) Discrete Appl Math , vol.20 , pp. 233-242
- Lee, C.Y.¹ Massey, J.D.²

9
- 0004048738
- Springer, Berlin Heidelberg New York
- Blazewicz J, Ecker K, Pesch E, Schmidt G, Weglarz J (1996) Scheduling computer and manufacturing systems. Springer, Berlin Heidelberg New York
- (1996) Scheduling Computer and Manufacturing Systems
- Blazewicz, J.¹ Ecker, K.² Pesch, E.³ Schmidt, G.⁴ Weglarz, J.⁵

10
- 0011746740
- max problem
- max problem. Topology 4:345-359
- (1996) Topology , vol.4 , pp. 345-359
- Riera, J.¹ Alcaide, D.² Sicilia, J.³

11
- 0032183061
- A pairwise interchange algorithm for parallel machine scheduling
- Fatemi Ghomi SMT, Jolai Ghazvini F (1998) A pairwise interchange algorithm for parallel machine scheduling. Prod Plan Control 9:685-689
- (1998) Prod Plan Control , vol.9 , pp. 685-689
- Fatemi Ghomi, S.M.T.¹ Jolai Ghazvini, F.²

12
- 26444479778
- Optimization by simulated annealing
- Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671-680
- (1983) Science , vol.220 , Issue.4598 , pp. 671-680
- Kirkpatrick, S.¹ Gelatt, C.D.² Vecchi, M.P.³

13
- 0031245643
- Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem
- Ruiz-Torres AJ, Enscore EE, Barton RR (1997) Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Comput Ind Eng 33:257-260
- (1997) Comput Ind Eng , vol.33 , pp. 257-260
- Ruiz-Torres, A.J.¹ Enscore, E.E.² Barton, R.R.³

14
- 0031341489
- Search heuristics for a parallel machine scheduling problem with ready times and due dates
- Park MW, Kim YD (1997) Search heuristics for a parallel machine scheduling problem with ready times and due dates. Comput Ind Eng 33:793-796
- (1997) Comput Ind Eng , vol.33 , pp. 793-796
- Park, M.W.¹ Kim, Y.D.²

15
- 0034631284
- Simulated annealing for parallel machine scheduling problem with earliness-tardiness penalties and sequence-dependent set-up times
- Radhakrishnan S, Ventura JA (2000) Simulated annealing for parallel machine scheduling problem with earliness-tardiness penalties and sequence-dependent set-up times. Int J Prod Res 38:2233-2252
- (2000) Int J Prod Res , vol.38 , pp. 2233-2252
- Radhakrishnan, S.¹ Ventura, J.A.²

16
- 0037328729
- Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective
- Kim DW, Na DG, Chen FF (2003) Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robot Comput-Int Manuf 19:173-181
- (2003) Robot Comput-Int Manuf , vol.19 , pp. 173-181
- Kim, D.W.¹ Na, D.G.² Chen, F.F.³

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