메뉴 건너뛰기




Volumn 2328, Issue , 2002, Pages 79-86

A greedy approach for a time-dependent scheduling problem

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SCHEDULING;

EID: 23044534635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48086-2_9     Document Type: Conference Paper
Times cited : (11)

References (13)
  • 1
    • 0032682389 scopus 로고    scopus 로고
    • Scheduling with time dependent processing times: Review and extensions
    • Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: Review and extensions. J. Optl Res. Soc. 50 (1999) 711–720.
    • (1999) J. Optl Res. Soc , vol.50 , pp. 711-720
    • Alidaee, B.1    Womer, N.K.2
  • 2
    • 0003051113 scopus 로고    scopus 로고
    • Parallel machine scheduling with time dependent processing times
    • Erratum: Discr. Appl. Math. 75 (1996) 103
    • Chen, Z-L.: Parallel machine scheduling with time dependent processing times. Discr. Appl. Math. 70 (1996) 81–93. (Erratum: Discr. Appl. Math. 75 (1996) 103.)
    • (1996) Discr. Appl. Math , vol.70 , pp. 81-93
    • Chen, Z.-L.1
  • 3
    • 0002467939 scopus 로고    scopus 로고
    • Brief survey of continuous models of scheduling
    • Gawiejnowicz, S.: Brief survey of continuous models of scheduling. Found. Comput. Dec. Sci. 21 (1996) 81–100.
    • (1996) Found. Comput. Dec. Sci , vol.21 , pp. 81-100
    • Gawiejnowicz, S.1
  • 5
    • 0004694723 scopus 로고
    • Scheduling jobs with varying processing times
    • Gawiejnowicz, S., Pankowska, L.: Scheduling jobs with varying processing times. Inf. Proc. Lett. 54 (1995), 175–178.
    • (1995) Inf. Proc. Lett , vol.54 , pp. 175-178
    • Gawiejnowicz, S.1    Pankowska, L.2
  • 6
    • 33746918850 scopus 로고    scopus 로고
    • Approximate solution of a time-dependent scheduling problem for lp−norm-based criteria
    • In: Fleischmann, B., et al. (eds.), Selected Papers of the Symposium on Operations Research, Springer, Berlin
    • Gawiejnowicz, S., Kurc, W., Pankowska, L., Suwalski, C.: Approximate solution of a time-dependent scheduling problem for lp−norm-based criteria. In: Fleischmann, B., et al. (eds.), Operations Research OR 2000. Selected Papers of the Symposium on Operations Research, Springer, Berlin (2001) 372–377.
    • (2001) Operations Research OR 2000 , pp. 372-377
    • Gawiejnowicz, S.1    Kurc, W.2    Pankowska, L.3    Suwalski, C.4
  • 9
    • 0001553709 scopus 로고    scopus 로고
    • Scheduling problems with linear increasing processing times
    • In: Zimmermann, U., et al. (eds.), Selected Papers of the Symposium on Operations Research, Springer, Berlin
    • Kononov, A.V.: Scheduling problems with linear increasing processing times. In: Zimmermann, U., et al. (eds.), Operations Research 1996. Selected Papers of the Symposium on Operations Research, Springer, Berlin (1997) 208–212.
    • (1997) Operations Research 1996 , pp. 208-212
    • Kononov, A.V.1
  • 10
    • 0035365406 scopus 로고    scopus 로고
    • NP-hard cases in scheduling deteriorating jobs on dedicated machines
    • Kononov, A., Gawiejnowicz, S.: NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Optl Res. Soc. 52 (2001) 708–717.
    • (2001) J. Optl Res. Soc , vol.52 , pp. 708-717
    • Kononov, A.1    Gawiejnowicz, S.2
  • 11
    • 0026258725 scopus 로고
    • V-shaped policies for scheduling deteriorating jobs
    • Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Oper. Res. 39 (1991) 979–991.
    • (1991) Oper. Res , vol.39 , pp. 979-991
    • Mosheiov, G.1
  • 12
    • 0028463787 scopus 로고
    • Scheduling jobs under simple linear deterioration
    • Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comp. Oper. Res. 21 (1994) 653–659.
    • (1994) Comp. Oper. Res , vol.21 , pp. 653-659
    • Mosheiov, G.1


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