메뉴 건너뛰기




Volumn 130, Issue 1, 2004, Pages 17-25

Irrigation scheduling. II: Heuristics approach

Author keywords

Algorithms; Irrigation scheduling; Optimization; Water allocation policy

Indexed keywords

COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

EID: 1242344721     PISSN: 07339437     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-9437(2004)130:1(17)     Document Type: Article
Times cited : (8)

References (9)
  • 1
    • 0000369074 scopus 로고    scopus 로고
    • Obtaining test problems via internet
    • Beasley, J. E. (1996). "Obtaining test problems via internet." J. Global Optim., 8, 429-433.
    • (1996) J. Global Optim. , vol.8 , pp. 429-433
    • Beasley, J.E.1
  • 2
    • 0020969878 scopus 로고
    • Irrigation water delivery for equity between users
    • Bishop, A. A., and Long, A. K. (1983). "Irrigation water delivery for equity between users." J. Irrig. Drain. Eng., 109(4), 349-356.
    • (1983) J. Irrig. Drain. Eng. , vol.109 , Issue.4 , pp. 349-356
    • Bishop, A.A.1    Long, A.K.2
  • 3
    • 0028734441 scopus 로고
    • Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
    • Kim, Y., and Yano, C. A. (1994). "Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates." Naval Res. Logistics Quart., 41, 913-944.
    • (1994) Naval Res. Logistics Quart. , vol.41 , pp. 913-944
    • Kim, Y.1    Yano, C.A.2
  • 4
    • 0030735290 scopus 로고    scopus 로고
    • A heuristic to minimize the total weighted sequence-dependent setups
    • Lee, Y. H., Bhaskaran, K., and Pinedo, M. (1997). "A heuristic to minimize the total weighted sequence-dependent setups." IIE Trans., 29, 45-52.
    • (1997) IIE Trans. , vol.29 , pp. 45-52
    • Lee, Y.H.1    Bhaskaran, K.2    Pinedo, M.3
  • 5
    • 0035192727 scopus 로고    scopus 로고
    • A heuristic for single machine scheduling with early and tardy costs
    • Mazzini, R., and Armantano, V. A. (2001). "A heuristic for single machine scheduling with early and tardy costs." Eur. J. Oper. Res., 128, 129-146.
    • (2001) Eur. J. Oper. Res. , vol.128 , pp. 129-146
    • Mazzini, R.1    Armantano, V.A.2
  • 6
    • 0020699921 scopus 로고
    • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    • Nawaz, M., Enscore, E. E., Jr., and Ham, I. (1983). "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem." OMEGA Int. J. Manage. Sci., 11(1), 91-95.
    • (1983) OMEGA Int. J. Manage. Sci. , vol.11 , Issue.1 , pp. 91-95
    • Nawaz, M.1    Enscore Jr., E.E.2    Ham, I.3
  • 7
    • 0000245614 scopus 로고
    • The single machine early/tardy problem
    • Ow, P. S., and Morton, T. E. (1989). "The single machine early/tardy problem." Manage. Sci., 35(2), 177-191.
    • (1989) Manage. Sci. , vol.35 , Issue.2 , pp. 177-191
    • Ow, P.S.1    Morton, T.E.2
  • 8
    • 0020205577 scopus 로고
    • A decomposition algorithm for the single machine total tardiness problem
    • Potts, C. N., and Van Wassenhove, L. N. (1982). "A decomposition algorithm for the single machine total tardiness problem." Oper. Res. Lett., 1(5), 177-181.
    • (1982) Oper. Res. Lett. , vol.1 , Issue.5 , pp. 177-181
    • Potts, C.N.1    Van Wassenhove, L.N.2
  • 9
    • 0035335852 scopus 로고    scopus 로고
    • Experimental evaluation of heuristic optimization algorithms: A tutorial
    • Rardin, R. L., and Uzsoy, R. (2001). "Experimental evaluation of heuristic optimization algorithms: A tutorial." J. Heuristics, 7, 261-304.
    • (2001) J. Heuristics , vol.7 , pp. 261-304
    • Rardin, R.L.1    Uzsoy, R.2


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