메뉴 건너뛰기




Volumn 38, Issue 1, 2011, Pages 301-309

Size-reduction heuristics for the unrelated parallel machines scheduling problem

Author keywords

Makespan; Size reduction; Unrelated parallel machines

Indexed keywords

COMBINATORIAL OPTIMIZATION; SIZE DETERMINATION;

EID: 78049444137     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.05.005     Document Type: Conference Paper
Times cited : (55)

References (38)
  • 4
    • 85098047684 scopus 로고    scopus 로고
    • Planning and scheduling in manufacturing and services
    • Springer New York, USA
    • M.L. Pinedo Planning and scheduling in manufacturing and services Springer series in operations research 2005 Springer New York, USA
    • (2005) Springer Series in Operations Research
    • Pinedo, M.L.1
  • 7
    • 0002643827 scopus 로고
    • Scheduling with deadlines and loss functions
    • R. McNaughton Scheduling with deadlines and loss functions Management Science 6 1 1959 1 12
    • (1959) Management Science , vol.6 , Issue.1 , pp. 1-12
    • McNaughton, R.1
  • 8
    • 0025474221 scopus 로고
    • A state-of-the-art review of parallel-machine scheduling research
    • T.C.E. Cheng, and C.C.S. Sin A state-of-the-art review of parallel-machine scheduling research European Journal of Operational Research 47 3 1990 271 292
    • (1990) European Journal of Operational Research , vol.47 , Issue.3 , pp. 271-292
    • Cheng, T.C.E.1    Sin, C.C.S.2
  • 10
    • 77953870243 scopus 로고    scopus 로고
    • Iterated greedy local search methods for unrelated parallel machine scheduling
    • doi: 10.1016/j.ejor.2010.03.030;2010
    • Fanjul-Peyro L, Ruiz R. Iterated greedy local search methods for unrelated parallel machine scheduling, European Journal of Operational Research, doi: 10.1016/j.ejor.2010.03.030 ; 2010.
    • European Journal of Operational Research
    • Fanjul-Peyro, L.1    Ruiz, R.2
  • 11
    • 0016943203 scopus 로고
    • Exact and approximate algorithms for scheduling nonidentical processors
    • E. Horowitz, and S. Sahni Exact and approximate algorithms for scheduling nonidentical processors Journal of the ACM 23 2 1976 317 327
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 12
    • 0000769475 scopus 로고
    • Heuristic algorithms for scheduling independent tasks on nonidentical processors
    • O.H. Ibarra, and C.E. Kim Heuristic algorithms for scheduling independent tasks on nonidentical processors Journal of the ACM 24 2 1977 280 289
    • (1977) Journal of the ACM , vol.24 , Issue.2 , pp. 280-289
    • Ibarra, O.H.1    Kim, C.E.2
  • 13
    • 84989427485 scopus 로고
    • Scheduling to minimise makespan on unequal parallel processors
    • P. De, and T.E. Morton Scheduling to minimise makespan on unequal parallel processors Management Science 11 4 1980 586 602
    • (1980) Management Science , vol.11 , Issue.4 , pp. 586-602
    • De, P.1    Morton, T.E.2
  • 14
    • 0019625166 scopus 로고
    • Algorithms for scheduling tasks on unrelated processors
    • E. Davis, and J.M. Jaffe Algorithms for scheduling tasks on unrelated processors Journal of the ACM 28 4 1981 721 736
    • (1981) Journal of the ACM , vol.28 , Issue.4 , pp. 721-736
    • Davis, E.1    Jaffe, J.M.2
  • 15
    • 0000438412 scopus 로고
    • Approximation algorithms for scheduling unrelated parallel machines
    • J.K. Lenstra, D.B. Shmoys, and E. Tardos Approximation algorithms for scheduling unrelated parallel machines Mathematical Programming 46 3 1990 259 271
    • (1990) Mathematical Programming , vol.46 , Issue.3 , pp. 259-271
    • Lenstra, J.K.1    Shmoys, D.B.2    Tardos, E.3
  • 16
    • 0001679827 scopus 로고    scopus 로고
    • Exact and approximation algorithms for makespan minimization on unrelated parallel machines
    • S. Martello, F. Soumis, and P. Toth Exact and approximation algorithms for makespan minimization on unrelated parallel machines Discrete Applied Mathematics 75 2 1997 169 188
    • (1997) Discrete Applied Mathematics , vol.75 , Issue.2 , pp. 169-188
    • Martello, S.1    Soumis, F.2    Toth, P.3
  • 17
    • 0000804104 scopus 로고
    • Duality based algorithms for scheduling unrelated parallel machines
    • S.L. van de Velde Duality based algorithms for scheduling unrelated parallel machines ORSA Journal on Computing 5 5 1993 192 205
    • (1993) ORSA Journal on Computing , vol.5 , Issue.5 , pp. 192-205
    • Van De Velde, S.L.1
  • 18
    • 0020709337 scopus 로고
    • Analysis of a linear-programming heuristic for scheduling unrelated parallel machines
    • C.N. Potts Analysis of a linear-programming heuristic for scheduling unrelated parallel machines Discrete Applied Mathematics 10 2 1985 155 164
    • (1985) Discrete Applied Mathematics , vol.10 , Issue.2 , pp. 155-164
    • Potts, C.N.1
  • 19
    • 0038309442 scopus 로고
    • An approximation algorithm for the generalized assignment problem
    • D.B. Shmoys, and E. Tardos An approximation algorithm for the generalized assignment problem Mathematical Programming 62 3 1993 461 474
    • (1993) Mathematical Programming , vol.62 , Issue.3 , pp. 461-474
    • Shmoys, D.B.1    Tardos, E.2
  • 20
    • 9644301278 scopus 로고    scopus 로고
    • An optimal rounding gives a better approximation for scheduling unrelated machines
    • E.V. Shchepin, and N. Vakhania An optimal rounding gives a better approximation for scheduling unrelated machines Operations Research Letters 33 2 2005 127 133
    • (2005) Operations Research Letters , vol.33 , Issue.2 , pp. 127-133
    • Shchepin, E.V.1    Vakhania, N.2
  • 21
    • 0025862665 scopus 로고
    • Heuristics for scheduling unrelated parallel machines
    • A.M.A. Hariri, and C.N. Potts Heuristics for scheduling unrelated parallel machines Computers & Operations Research 18 3 1991 323 331
    • (1991) Computers & Operations Research , vol.18 , Issue.3 , pp. 323-331
    • Hariri, A.M.A.1    Potts, C.N.2
  • 23
    • 0030295335 scopus 로고    scopus 로고
    • A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
    • N. Piersma, and W. van Dijk A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search Mathematical and Computer Modelling 24 9 1996 11 19
    • (1996) Mathematical and Computer Modelling , vol.24 , Issue.9 , pp. 11-19
    • Piersma, N.1    Van Dijk, W.2
  • 24
    • 0032140746 scopus 로고    scopus 로고
    • An effective heuristic for minimising makespan on unrelated parallel machines
    • B. Srivastava 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
  • 25
    • 0035504128 scopus 로고    scopus 로고
    • Scheduling tasks on unrelated machines: Large neighborhood improvement procedures
    • F. Sourd Scheduling tasks on unrelated machines: large neighborhood improvement procedures Journal of Heuristics 7 6 2001 519 531
    • (2001) Journal of Heuristics , vol.7 , Issue.6 , pp. 519-531
    • Sourd, F.1
  • 26
    • 0037120617 scopus 로고    scopus 로고
    • A cutting plane algorithm for the unrelated parallel machine scheduling problem
    • E. Mokotoff, and P. Chretienne A cutting plane algorithm for the unrelated parallel machine scheduling problem European Journal of Operational Research 141 3 2002 515 525
    • (2002) European Journal of Operational Research , vol.141 , Issue.3 , pp. 515-525
    • Mokotoff, E.1    Chretienne, P.2
  • 27
    • 0036961541 scopus 로고    scopus 로고
    • Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem
    • E. Mokotoff, and J.L. Jimeno Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem Annals of Operations Research 117 14 2002 133 150
    • (2002) Annals of Operations Research , vol.117 , Issue.14 , pp. 133-150
    • Mokotoff, E.1    Jimeno, J.L.2
  • 28
    • 0028769399 scopus 로고
    • On practical resource-allocation for production planning and scheduling with period overlapping setups
    • C. Dillenberger, L.F. Escudero, A. Wollensak, and Z. Wu On practical resource-allocation for production planning and scheduling with period overlapping setups European Journal of Operational Research 75 2 1994 275 286
    • (1994) European Journal of Operational Research , vol.75 , Issue.2 , pp. 275-286
    • Dillenberger, C.1    Escudero, L.F.2    Wollensak, A.3    Wu, Z.4
  • 29
    • 0033115630 scopus 로고    scopus 로고
    • Heuristic algorithms for the portfolio selection problem with minimum transaction lots
    • R. Mansini, and M.G. Speranza Heuristic algorithms for the portfolio selection problem with minimum transaction lots European Journal of Operational Research 114 2 1999 219 233
    • (1999) European Journal of Operational Research , vol.114 , Issue.2 , pp. 219-233
    • Mansini, R.1    Speranza, M.G.2
  • 31
    • 13444278719 scopus 로고    scopus 로고
    • Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
    • M. Ghirardi, and C.N. Potts Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach European Journal of Operational Research 165 2 2005 457 467
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 457-467
    • Ghirardi, M.1    Potts, C.N.2
  • 32
    • 2142657295 scopus 로고    scopus 로고
    • Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
    • F. de la Croce, M. Ghirardi, and R. Tadei Recovering beam search: enhancing the beam search approach for combinatorial optimization problems Journal of Heuristics 10 1 2004 89 104
    • (2004) Journal of Heuristics , vol.10 , Issue.1 , pp. 89-104
    • De La Croce, F.1    Ghirardi, M.2    Tadei, R.3
  • 34
    • 34248525920 scopus 로고    scopus 로고
    • A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
    • M. Gairing, B. Monien, and A. Woclaw A faster combinatorial approximation algorithm for scheduling unrelated parallel machines Theoretical Computer Science 380 12 2007 87 99
    • (2007) Theoretical Computer Science , vol.380 , Issue.12 , pp. 87-99
    • Gairing, M.1    Monien, B.2    Woclaw, A.3
  • 35
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • R. Ruiz, and T. Sttzle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 177 3 2007 2033 2049
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2033-2049
    • Ruiz, R.1    Sttzle, T.2
  • 37
    • 0034818087 scopus 로고    scopus 로고
    • Variable neighborhood search: Principles and applications
    • DOI 10.1016/S0377-2217(00)00100-4
    • P. Hansen, and N. Mladenovic Variable neighborhood search: principles and applications European Journal of Operational Research 130 3 2001 449 467 (Pubitemid 32875304)
    • (2001) European Journal of Operational Research , vol.130 , Issue.3 , pp. 449-467
    • Hansen, P.1    Mladenovic, N.2


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