메뉴 건너뛰기




Volumn 226, Issue 1, 2013, Pages 46-52

Outsourcing and scheduling for two-machine ordered flow shop scheduling problems

Author keywords

Computational complexity; Ordered flow shop; Outsourcing; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONTRACTORS; MACHINE SHOP PRACTICE; OUTSOURCING; SCHEDULING;

EID: 84873056463     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2012.10.048     Document Type: Article
Times cited : (29)

References (23)
  • 1
    • 0030270129 scopus 로고    scopus 로고
    • Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness
    • Allahverdi, A., 1996. Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness. Computers and Operations Research 23, 909-916.
    • (1996) Computers and Operations Research , vol.23 , pp. 909-916
    • Allahverdi, A.1
  • 2
    • 0036815272 scopus 로고    scopus 로고
    • Competition and outsourcing with scale economies
    • Cachon, G.P., Harker, P.T., 2002. Competition and outsourcing with scale economies. Management Science 48, 1314-1333.
    • (2002) Management Science , vol.48 , pp. 1314-1333
    • Cachon, G.P.1    Harker, P.T.2
  • 3
    • 55049137385 scopus 로고    scopus 로고
    • Scheduling with subcontracting options
    • Chen, Z.L., Li, C.L., 2008. Scheduling with subcontracting options. IIE Transactions 40, 1171-1184.
    • (2008) IIE Transactions , vol.40 , pp. 1171-1184
    • Chen, Z.L.1    Li, C.L.2
  • 4
    • 79955614863 scopus 로고    scopus 로고
    • Two-machine flow shop scheduling problem with an outsourcing option
    • Choi, B.C., Chung, J.B., 2011. Two-machine flow shop scheduling problem with an outsourcing option. European Journal of Operational Research 213, 66-72.
    • (2011) European Journal of Operational Research , vol.213 , pp. 66-72
    • Choi, B.C.1    Chung, J.B.2
  • 5
    • 83555172646 scopus 로고    scopus 로고
    • Minimizing makespan in an ordered flow shop with machine-dependent processing times
    • Choi, B.C., Leung, J.Y.T., Pinedo, M.L., 2011. Minimizing makespan in an ordered flow shop with machine-dependent processing times. Journal of Combinatorial Optimization. 22, 797-818.
    • (2011) Journal of Combinatorial Optimization. , vol.22 , pp. 797-818
    • Choi, B.C.1    Leung, J.Y.T.2    Pinedo, M.L.3
  • 7
    • 33749558671 scopus 로고    scopus 로고
    • Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
    • Choi, B.C., Yoon, S.H., Chung, S.J., 2007. Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research 176, 964-974.
    • (2007) European Journal of Operational Research , vol.176 , pp. 964-974
    • Choi, B.C.1    Yoon, S.H.2    Chung, S.J.3
  • 8
    • 26044467346 scopus 로고    scopus 로고
    • A new approach to job shop scheduling problems with due date constraints considering operation subcontracts
    • Chung, D., Lee, K., Shin, K., Park, J., 2005. A new approach to job shop scheduling problems with due date constraints considering operation subcontracts. International Journal of Production Economics 98, 238-250.
    • (2005) International Journal of Production Economics , vol.98 , pp. 238-250
    • Chung, D.1    Lee, K.2    Shin, K.3    Park, J.4
  • 9
    • 0037402799 scopus 로고    scopus 로고
    • The three-machine proportionate flow shop with unequal machine speeds
    • Hou, S., Hoogeveen, H., 2003. The three-machine proportionate flow shop with unequal machine speeds. Operations Research Letters 31, 225-231.
    • (2003) Operations Research Letters , vol.31 , pp. 225-231
    • Hou, S.1    Hoogeveen, H.2
  • 11
    • 35548956964 scopus 로고    scopus 로고
    • Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed
    • Lee, I.S., Sung, C.S., 2008a. Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed. European Journal of Operational Research 186, 931-952.
    • (2008) European Journal of Operational Research , vol.186 , pp. 931-952
    • Lee, I.S.1    Sung, C.S.2
  • 13
    • 79957688480 scopus 로고    scopus 로고
    • Two-stage production scheduling with an outsourcing option
    • Lee, K.B., Choi, B.C., 2011. Two-stage production scheduling with an outsourcing option. European Journal of Operational Research 213, 489-497.
    • (2011) European Journal of Operational Research , vol.213 , pp. 489-497
    • Lee, K.B.1    Choi, B.C.2
  • 14
    • 0022093883 scopus 로고
    • Focused scheduling in proportionate flow shops
    • Ow, P.S., 1985. Focused scheduling in proportionate flow shops. Management Science 31, 852-869.
    • (1985) Management Science , vol.31 , pp. 852-869
    • Ow, P.S.1
  • 15
    • 0016993158 scopus 로고
    • An ordered flow shop sequencing problem with mean completion time criterion
    • Panwalkar, S.S., Khan, A.W., 1976. An ordered flow shop sequencing problem with mean completion time criterion. International Journal of Production Research 14, 631-635.
    • (1976) International Journal of Production Research , vol.14 , pp. 631-635
    • Panwalkar, S.S.1    Khan, A.W.2
  • 17
    • 0000660478 scopus 로고
    • Flow shop sequencing problem with ordered processing time matrices
    • Smith, M.L., Panwalkar, S.S., Dudek, R.A., 1975. Flow shop sequencing problem with ordered processing time matrices. Management Science 21, 544-549.
    • (1975) Management Science , vol.21 , pp. 544-549
    • Smith, M.L.1    Panwalkar, S.S.2    Dudek, R.A.3
  • 18
    • 0017001721 scopus 로고
    • Flow shop sequencing problem with ordered processing time matrices: A general case
    • Smith, M.L., Panwalkar, S.S., Dudek, R.A., 1976. Flow shop sequencing problem with ordered processing time matrices: A general case. Naval Research Logistics Quarterly 23, 481-486.
    • (1976) Naval Research Logistics Quarterly , vol.23 , pp. 481-486
    • Smith, M.L.1    Panwalkar, S.S.2    Dudek, R.A.3
  • 19
    • 38149033826 scopus 로고    scopus 로고
    • Coordinated logistics scheduling for in-house production and outsourcing
    • Qi, X., 2008. Coordinated logistics scheduling for in-house production and outsourcing. IEEE Transactions on Automation Science and Engineering 5, 188-192.
    • (2008) IEEE Transactions on Automation Science and Engineering , vol.5 , pp. 188-192
    • Qi, X.1
  • 20
    • 58149121493 scopus 로고    scopus 로고
    • Two-stage production scheduling with an option of outsourcing from a remote supplier
    • Qi, X., 2009. Two-stage production scheduling with an option of outsourcing from a remote supplier. Journal of System Science and System Engineering 18, 1-15.
    • (2009) Journal of System Science and System Engineering , vol.18 , pp. 1-15
    • Qi, X.1
  • 21
    • 78649316983 scopus 로고    scopus 로고
    • Outsourcing and production scheduling for a two-stage flow shop
    • Qi, X., 2011. Outsourcing and production scheduling for a two-stage flow shop. International Journal of Production Economics 129, 43-50.
    • (2011) International Journal of Production Economics , vol.129 , pp. 43-50
    • Qi, X.1
  • 23
    • 0007604993 scopus 로고    scopus 로고
    • When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme?
    • Woeginger, G.J., 2000. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme? INFORMS Journal on Computing 12, 57-74.
    • (2000) INFORMS Journal on Computing , vol.12 , pp. 57-74
    • Woeginger, G.J.1


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