메뉴 건너뛰기




Volumn 6, Issue 2, 2007, Pages 287-296

A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data

Author keywords

Interval data; Mixed integer linear programming; Scheduling problems

Indexed keywords


EID: 34248137031     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1007/s10852-006-9044-3     Document Type: Article
Times cited : (43)

References (13)
  • 1
    • 33947578466 scopus 로고    scopus 로고
    • Provisioning virtual private networks under traffic uncertainty
    • to appear
    • Altin, A., Amaldi, E., Belotti, P., Pinar, M.: Provisioning virtual private networks under traffic uncertainty. Networks (to appear)
    • Networks
    • Altin, A.1    Amaldi, E.2    Belotti, P.3    Pinar, M.4
  • 3
    • 34250097087 scopus 로고
    • Algorithms and codes for the assignment problem
    • Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Ann. Oper. Res. 7, 200-218 (1988)
    • (1988) Ann. Oper. Res , vol.7 , pp. 200-218
    • Carpaneto, G.1    Martello, S.2    Toth, P.3
  • 4
    • 0029254356 scopus 로고
    • Robust scheduling to hedge against processing time uncertainty in single-stage production
    • Daniels, R., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag. Sci. 41(2), 363-376 (1995)
    • (1995) Manag. Sci , vol.41 , Issue.2 , pp. 363-376
    • Daniels, R.1    Kouvelis, P.2
  • 5
    • 0003533609 scopus 로고    scopus 로고
    • Performance of various computers using standard linear algebra software in a fortran environment
    • Tech. Rep. CS-89-85, University of Tennessee
    • Dongarra, J.: Performance of various computers using standard linear algebra software in a fortran environment. Tech. Rep. CS-89-85, University of Tennessee (2006)
    • (2006)
    • Dongarra, J.1
  • 6
    • 74849101820 scopus 로고
    • Optimization and approximation in deterministic sequencing and scheduling: A survey
    • Graham, R., Lawler, E., Lenstra, J., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math. 5, 287-326 (1979)
    • (1979) Ann. Discrete Math , vol.5 , pp. 287-326
    • Graham, R.1    Lawler, E.2    Lenstra, J.3    Kan, A.R.4
  • 7
    • 30344473284 scopus 로고    scopus 로고
    • An approximation algorithm for interval data min-max regret combinatorial optimization problems
    • Kasperski, A., Zieliński, P.: An approximation algorithm for interval data min-max regret combinatorial optimization problems. Inf. Process. Lett. 97(5), 177-180 (2006)
    • (2006) Inf. Process. Lett , vol.97 , Issue.5 , pp. 177-180
    • Kasperski, A.1    Zieliński, P.2
  • 10
    • 0008824985 scopus 로고
    • Stochastic shop scheduling: A survey
    • Dempster, M.A.H, et al, eds, Reidel, Dordrecht
    • Pinedo, M., Schrage, L.: Stochastic shop scheduling: A survey. In: Dempster, M.A.H., et al. (eds.) Deterministic and Stochastic Scheduling. Reidel, Dordrecht (1982)
    • (1982) Deterministic and Stochastic Scheduling
    • Pinedo, M.1    Schrage, L.2
  • 11
    • 0002066821 scopus 로고
    • Various optimizers for single-stage production
    • Smith, W.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59-66 (1956)
    • (1956) Nav. Res. Logist. Q , vol.3 , pp. 59-66
    • Smith, W.1
  • 13
    • 34248182975 scopus 로고    scopus 로고
    • Restricted robust uniform matroid maximization under interval uncertainty
    • to appear
    • Yaman, H., Karaşan, O., Pinar, M.: Restricted robust uniform matroid maximization under interval uncertainty. Math. Program., Ser. A (to appear)
    • Math. Program., Ser. A
    • Yaman, H.1    Karaşan, O.2    Pinar, M.3


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