메뉴 건너뛰기




Volumn 14, Issue , 2002, Pages 115-120

A simulated annealing algorithm for the unrelated parallel machine scheduling problem

Author keywords

Integer program; Scheduling; Setup times; Simulated annealing; Unrelated parallel machines

Indexed keywords

COMPLETION TIME; INTEGER PROGRAM; MAKESPAN; NP-HARD; OPTIMAL SOLUTIONS; OPTIMUM SOLUTION; SCHEDULING JOBS; SEQUENCE-DEPENDENT SETUP TIME; SET-UP TIME; SIMULATED ANNEALING ALGORITHMS; TEST PROBLEM; UNRELATED PARALLEL MACHINES;

EID: 38949160036     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (25)

References (20)
  • 2
    • 0025474221 scopus 로고
    • A State-of-the-Art Review of Parallel-Machine Scheduling Research
    • Cheng, T. and Sin, C. "A State-of-the-Art Review of Parallel-Machine Scheduling Research". European Journal of Operation Research, 47 (1990), 271-292.
    • (1990) European Journal of Operation Research , vol.47 , pp. 271-292
    • Cheng, T.1    Sin, C.2
  • 3
    • 0000804104 scopus 로고
    • Duality-Based Algorithm for Scheduling Unrelated Parallel Machines
    • ven de Velde, S. 1993. "Duality-Based Algorithm for Scheduling Unrelated Parallel Machines". ORSA Journal of Computing, 5, 192-205.
    • (1993) ORSA Journal of Computing , vol.5 , pp. 192-205
    • Ven De Velde, S.1
  • 4
    • 21344476553 scopus 로고
    • On modeling the maximum workload allocation for parallel unrelated machines with setups
    • Dietrich, B-L., and Escudero, L-F. "On modeling the maximum workload allocation for parallel unrelated machines with setups", Annals of Operations Research 43(1-4)(1993), 359-377
    • (1993) Annals of Operations Research , vol.43 , Issue.1-4 , pp. 359-377
    • Dietrich, B.-L.1    Escudero, L.-F.2
  • 5
    • 0001679827 scopus 로고    scopus 로고
    • Exact and approximation algorithms for makespan minimization on unrelated parallel machines
    • PII S0166218X9600087X
    • Martello, S., Soumis, F., and Toth, P. "Exact and Approximation Algorithm for Makespan Minimization on Unrelated Parallel Machines". Discrete Applied Mathematics, 75(1997), 169-188. (Pubitemid 127410571)
    • (1997) Discrete Applied Mathematics , vol.75 , Issue.2 , pp. 169-188
    • Martello, S.1    Soumis, F.2    Toth, P.3
  • 6
    • 0016943203 scopus 로고
    • Exact and Approximation Algorithms for Scheduling Nonidentical Processors
    • Horowitz, E. and Sahni, S. "Exact and Approximation Algorithms for Scheduling Nonidentical Processors". Journal of the Association for Computing machinery, 23(1976), 317-327.
    • (1976) Journal of the Association for Computing Machinery , vol.23 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 7
    • 0000769475 scopus 로고
    • Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
    • Ibarra, O. and Kim, C. "Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors". Journal of the Association for Computing machinery, 24(1977), 280-289.
    • (1977) Journal of the Association for Computing Machinery , vol.24 , pp. 280-289
    • Ibarra, O.1    Kim, C.2
  • 8
    • 84989427485 scopus 로고
    • Scheduling to Minimize Makespan on Unrelated Processors
    • De, P., and Morton, T. "Scheduling to Minimize Makespan on Unrelated Processors". Decision Sciences, 11(1980), 586-602.
    • (1980) Decision Sciences , vol.11 , pp. 586-602
    • Morton, T.1
  • 10
    • 0020709337 scopus 로고
    • Analysis of a Linear Programming Heuristic for Scheduling Unrelated Parallel Machines
    • Potts, C. "Analysis of A Linear Programming Heuristic for Scheduling Unrelated Parallel Machines". Discrete Applied Mathematics, 10(1985), 155-164.
    • (1985) Discrete Applied Mathematics , vol.10 , pp. 155-164
    • Potts, C.1
  • 11
    • 0030295335 scopus 로고    scopus 로고
    • A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search
    • Piersma, N. and van Dijk, W. "A Local Search Heuristic for Unrelated Parallel Machine Scheduling with Efficient Neighborhood Search", Mathematical and Computer Modeling, 24(9)(1996), 11-19
    • (1996) Mathematical and Computer Modeling , vol.24 , Issue.9 , pp. 11-19
    • Piersma, N.1    Van Dijk, W.2
  • 12
    • 0031275738 scopus 로고    scopus 로고
    • Heuristics for unrelated machine scheduling with precedence constraints
    • Herrman J., Proth, J-M., and Saur, N., "Heuristics for unrelated machine scheduling with precedence constraints", European Journal of Operation Research, 102(1997), 528-537.
    • (1997) European Journal of Operation Research , vol.102 , pp. 528-537
    • Herrman, J.1    Proth, J.-M.2    Saur, N.3
  • 13
    • 0032140746 scopus 로고    scopus 로고
    • An effective heuristic for minimising makespan on unrelated parallel machines
    • Srivastava, B., "An effective heuristic for minimising makespan on unrelated parallel machines", Journal of the Operational Research Society, 49(8)(1998), 886-894.
    • (1998) Journal of the Operational Research Society , vol.49 , Issue.8 , pp. 886-894
    • Srivastava, B.1
  • 14
    • 0030269395 scopus 로고    scopus 로고
    • A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups
    • Hochang, L. and Guignard, M. "A hybrid bounding procedure for the workload allocation problem on parallel unrelated machines with setups" Journal of Operational Research. Society. 47(10)(1996), 1247-1261. (Pubitemid 126580556)
    • (1996) Journal of the Operational Research Society , vol.47 , Issue.10 , pp. 1247-1261
    • Lee, H.1    Guignard, M.2
  • 16
    • 0026202405 scopus 로고
    • Textile Production Systems: A Succession of Non-identical Parallel Processor Shops
    • Guinet A., "Textile Production Systems: a Succession of Non-identical Parallel Processor Shops", Journal of Operational Research. Society, 42(8)(1991), 655-671.
    • (1991) Journal of Operational Research. Society , vol.42 , Issue.8 , pp. 655-671
    • Guinet, A.1
  • 17
    • 0035899630 scopus 로고    scopus 로고
    • A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
    • Gendreau, M., Laporte, L., and Guimaraes, E.M. "A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times", European Journal of Operational Research, 133(2001), 183-189.
    • (2001) European Journal of Operational Research , vol.133 , pp. 183-189
    • Gendreau, M.1    Laporte, L.2    Guimaraes, E.M.3
  • 19
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S. Kirkpatrick, C.D. Jr. Gelatt and M. Vecchi. "Optimization by simulated annealing", Science, 220(1983), 671-690.
    • (1983) Science , vol.220 , pp. 671-690
    • Kirkpatrick, S.1    Gelatt Jr., C.D.2    Vecchi, M.3
  • 20
    • 15744395705 scopus 로고    scopus 로고
    • A Hybrid Heuristic for the Just-In-Time Single Machine Scheduling Problem with Setups: A Comparison with a Simulated Annealing Approach
    • under review
    • Rabadi, G., Anagnostopoulos, G. C., and Mollaghasemi, M., "A Hybrid Heuristic for the Just-In-Time Single Machine Scheduling Problem with Setups: a Comparison with a Simulated Annealing Approach", under review, Journal of Annals of Operations Research.
    • Journal of Annals of Operations Research
    • Rabadi, G.1    Anagnostopoulos, G.C.2    Mollaghasemi, M.3


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