메뉴 건너뛰기




Volumn 6, Issue 4, 2007, Pages 563-576

Total completion time in a two-machine flowshop with deteriorating tasks

Author keywords

Flowshop; State dependent processing time; Total completion time

Indexed keywords


EID: 36549038690     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1007/s10852-007-9057-6     Document Type: Article
Times cited : (1)

References (14)
  • 1
    • 0025807474 scopus 로고
    • Single machine scheduling with nonlinear cost functions
    • Alidaee, B.: Single machine scheduling with nonlinear cost functions. Comput. Oper. Res. 18, 317-322 (1991)
    • (1991) Comput. Oper. Res. , vol.18 , pp. 317-322
    • Alidaee, B.1
  • 2
    • 0003051113 scopus 로고    scopus 로고
    • Parallel machine scheduling with time dependent processing times
    • Chen, Z.-L.: Parallel machine scheduling with time dependent processing times. Discrete Appl. Math. 70, 81-93 (1996)
    • (1996) Discrete Appl. Math. , vol.70 , pp. 81-93
    • Chen, Z.-L.1
  • 3
    • 0002584119 scopus 로고    scopus 로고
    • A variant of the permutation flow shop model with variable processing times
    • Finke, G., Jiang, H.: A variant of the permutation flow shop model with variable processing times. Discrete Appl. Math. 76, 123-140 (1997)
    • (1997) Discrete Appl. Math. , vol.76 , pp. 123-140
    • Finke, G.1    Jiang, H.2
  • 4
    • 23344436339 scopus 로고    scopus 로고
    • General flowshop models: Job dependent capacities, job overlapping and deterioration
    • Espinouse, M.-L., Finke, G., Jiang, H.: General flowshop models: job dependent capacities, job overlapping and deterioration. Int. Trans. Oper. Res. 9, 399-414 (2002)
    • (2002) Int. Trans. Oper. Res. , vol.9 , pp. 399-414
    • Espinouse, M.-L.1    Finke, G.2    Jiang, H.3
  • 5
    • 0024137249 scopus 로고
    • Single facility scheduling with nonlinear processing times
    • Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14, 387-393 (1988)
    • (1988) Comput. Ind. Eng. , vol.14 , pp. 387-393
    • Gupta, J.N.D.1    Gupta, S.K.2
  • 6
    • 0024030421 scopus 로고
    • General flow-shop scheduling with resource constraints
    • Janiak, A.: General flow-shop scheduling with resource constraints. Int. J. Prod. Res. 26, 1089-1103 (1988)
    • (1988) Int. J. Prod. Res. , vol.26 , pp. 1089-1103
    • Janiak, A.1
  • 7
    • 0024720011 scopus 로고
    • Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem
    • Janiak, A.: Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem. Inf. Process. Lett. 32, 101-112 (1989)
    • (1989) Inf. Process. Lett. , vol.32 , pp. 101-112
    • Janiak, A.1
  • 8
    • 0030305471 scopus 로고    scopus 로고
    • A-shaped policies to schedule deteriorating jobs
    • Mosheiov, G.: A-shaped policies to schedule deteriorating jobs. J. Oper. Res. Soc. 47, 1184-1191 (1996)
    • (1996) J. Oper. Res. Soc. , vol.47 , pp. 1184-1191
    • Mosheiov, G.1
  • 9
    • 0032204974 scopus 로고    scopus 로고
    • Multi-machine scheduling with linear deterioration
    • Mosheiov, G.: Multi-machine scheduling with linear deterioration. INFOR 36, 205-214 (1998)
    • (1998) INFOR , vol.36 , pp. 205-214
    • Mosheiov, G.1
  • 10
    • 84867973795 scopus 로고    scopus 로고
    • Complexity analysis of job-shop scheduling with deteriorating jobs
    • Mosheiov, G.: Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl. Math. 117, 195-209 (2002)
    • (2002) Discrete Appl. Math. , vol.117 , pp. 195-209
    • Mosheiov, G.1
  • 11
    • 84974864670 scopus 로고
    • Scheduling of two-machine flowshop with processing time linearly dependent on job waiting-time
    • Sriskandarajah, C., Goyal, S.K.: Scheduling of two-machine flowshop with processing time linearly dependent on job waiting-time. J. Oper. Res. Soc. 40, 907-921 (1989)
    • (1989) J. Oper. Res. Soc. , vol.40 , pp. 907-921
    • Sriskandarajah, C.1    Goyal, S.K.2
  • 12
    • 0004698603 scopus 로고
    • Hierarchical control of the two processor flow-shop with state-dependent processing time: Complexity analysis and approximate algorithms
    • Sriskandarajah, C., Wagneur, E.: Hierarchical control of the two processor flow-shop with state-dependent processing time: complexity analysis and approximate algorithms. INFOR 29, 193-205 (1991)
    • (1991) INFOR , vol.29 , pp. 193-205
    • Sriskandarajah, C.1    Wagneur, E.2
  • 13
    • 0000138484 scopus 로고
    • Optimal control of a class of deds: Flow-shops with state-dependent processing times
    • Wagneur, E., Sriskandarajah, C.: Optimal control of a class of deds: flow-shops with state-dependent processing times. Discret. Event Dyn. Syst., Theory Appl. 3, 397-425 (1993)
    • (1993) Discret. Event Dyn. Syst., Theory Appl. , vol.3 , pp. 397-425
    • Wagneur, E.1    Sriskandarajah, C.2
  • 14
    • 0027644088 scopus 로고
    • The two-machine permutation flow-shops with state-dependent processing times
    • Wagneur, E., Sriskandarajah, C.: The two-machine permutation flow-shops with state-dependent processing times. Nav. Res. Logist. 40, 697-717 (1993)
    • (1993) Nav. Res. Logist. , vol.40 , pp. 697-717
    • Wagneur, E.1    Sriskandarajah, C.2


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