IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v213y2011i1p66-72.html
   My bibliography  Save this article

Two-machine flow shop scheduling problem with an outsourcing option

Author

Listed:
  • Choi, Byung-Cheon
  • Chung, Jibok

Abstract

We consider a two-machine flow shop problem in which each job is processed through an in-house system or outsourced to a subcontractor. A schedule is established for the in-house jobs, and performance is measured by the makespan. Jobs processed by subcontractors require paying an outsourcing cost. The objective is to minimize the sum of the makespan and total outsourcing costs. We show that the problem is NP-hard in the ordinary sense. We consider a special case in which each job has a processing requirement, and each machine a characteristic value. In this case, the time a job occupies a machine is equal to the job's processing requirement plus a setup time equal to the characteristic value of that machine. We introduce some optimality conditions and present a polynomial-time algorithm to solve the special case.

Suggested Citation

  • Choi, Byung-Cheon & Chung, Jibok, 2011. "Two-machine flow shop scheduling problem with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(1), pages 66-72, August.
    • Handle: RePEc:eee:ejores:v:213:y:2011:i:1:p:66-72
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(11)00228-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
    2. Lee, Ik Sun & Sung, C.S., 2008. "Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed," European Journal of Operational Research, Elsevier, vol. 186(3), pages 931-952, May.
    3. Koulamas, Christos & Kyparisis, George J., 2009. "A note on the proportionate flow shop with a bottleneck machine," European Journal of Operational Research, Elsevier, vol. 193(2), pages 644-645, March.
    4. Lee, Ik Sun & Sung, C.S., 2008. "Single machine scheduling with outsourcing allowed," International Journal of Production Economics, Elsevier, vol. 111(2), pages 623-634, February.
    5. Peng Si Ow, 1985. "Focused Scheduling in Proportionate Flowshops," Management Science, INFORMS, vol. 31(7), pages 852-869, July.
    6. Qi, Xiangtong, 2011. "Outsourcing and production scheduling for a two-stage flow shop," International Journal of Production Economics, Elsevier, vol. 129(1), pages 43-50, January.
    7. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    8. Chung, Daeyoung & Lee, Kichang & Shin, Kitae & Park, Jinwoo, 2005. "A new approach to job shop scheduling problems with due date constraints considering operation subcontracts," International Journal of Production Economics, Elsevier, vol. 98(2), pages 238-250, November.
    9. Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.
    10. Choi, Byung-Cheon & Yoon, Suk-Hun & Chung, Sung-Jin, 2007. "Minimizing maximum completion time in a proportionate flow shop with one machine of different speed," European Journal of Operational Research, Elsevier, vol. 176(2), pages 964-974, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Choi, Byung-Cheon & Chung, Kwanghun, 2016. "Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 367-375.
    2. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    3. Shi-Sheng Li & De-Liang Qian & Ren-Xia Chen, 2017. "Proportionate Flow Shop Scheduling with Rejection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-13, August.
    4. Della Croce, Federico & Koulamas, Christos & T'kindt, Vincent, 2017. "A constraint generation approach for two-machine shop problems with jobs selection," European Journal of Operational Research, Elsevier, vol. 259(3), pages 898-905.
    5. Lingfa Lu & Liqi Zhang & Jie Zhang & Lili Zuo, 2020. "Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-15, January.
    6. Danny Hermelin & Dvir Shabtay & Chen Zelig & Michael Pinedo, 2022. "A general scheme for solving a large set of scheduling problems with rejection in FPT time," Journal of Scheduling, Springer, vol. 25(2), pages 229-255, April.
    7. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    8. Lingfa Lu & Liqi Zhang & Jinwen Ou, 2021. "In-house production and outsourcing under different discount schemes on the total outsourcing cost," Annals of Operations Research, Springer, vol. 298(1), pages 361-374, March.
    9. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chung, Dae-Young & Choi, Byung-Cheon, 2013. "Outsourcing and scheduling for two-machine ordered flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 226(1), pages 46-52.
    2. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    3. Choi, Byung-Cheon & Lee, Kangbok & Leung, Joseph Y.-T. & Pinedo, Michael L., 2010. "Flow shops with machine maintenance: Ordered and proportionate cases," European Journal of Operational Research, Elsevier, vol. 207(1), pages 97-104, November.
    4. Thürer, Matthias & Stevenson, Mark & Qu, Ting & Godinho Filho, Moacir, 2014. "The design of simple subcontracting rules for make-to-order shops: An assessment by simulation," European Journal of Operational Research, Elsevier, vol. 239(3), pages 854-864.
    5. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    6. Choi, Byung-Cheon & Chung, Kwanghun, 2016. "Min–max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty," European Journal of Operational Research, Elsevier, vol. 252(2), pages 367-375.
    7. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    8. Lee, Kangbok & Choi, Byung-Cheon, 2011. "Two-stage production scheduling with an outsourcing option," European Journal of Operational Research, Elsevier, vol. 213(3), pages 489-497, September.
    9. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    10. Lingfa Lu & Liqi Zhang & Jinwen Ou, 2021. "In-house production and outsourcing under different discount schemes on the total outsourcing cost," Annals of Operations Research, Springer, vol. 298(1), pages 361-374, March.
    11. Qi, Xiangtong, 2011. "Outsourcing and production scheduling for a two-stage flow shop," International Journal of Production Economics, Elsevier, vol. 129(1), pages 43-50, January.
    12. Zhong, Xueling & Ou, Jinwen & Wang, Guoqing, 2014. "Order acceptance and scheduling with machine availability constraints," European Journal of Operational Research, Elsevier, vol. 232(3), pages 435-441.
    13. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    14. Shi-Sheng Li & De-Liang Qian & Ren-Xia Chen, 2017. "Proportionate Flow Shop Scheduling with Rejection," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-13, August.
    15. Jinwen Ou & Xueling Zhong, 2017. "Order acceptance and scheduling with consideration of service level," Annals of Operations Research, Springer, vol. 248(1), pages 429-447, January.
    16. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    17. Koulamas, Christos, 1998. "On the complexity of two-machine flowshop problems with due date related objectives," European Journal of Operational Research, Elsevier, vol. 106(1), pages 95-100, April.
    18. Kim, Yeong-Dae, 1995. "Minimizing total tardiness in permutation flowshops," European Journal of Operational Research, Elsevier, vol. 85(3), pages 541-555, September.
    19. Rossit, Daniel A. & Vásquez, Óscar C. & Tohmé, Fernando & Frutos, Mariano & Safe, Martín D., 2021. "A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 289(3), pages 841-854.
    20. Panwalkar, S.S. & Koulamas, Christos, 2012. "An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines," European Journal of Operational Research, Elsevier, vol. 221(1), pages 7-13.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:213:y:2011:i:1:p:66-72. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.