IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v31y2014i04ns0217595914500286.html
   My bibliography  Save this article

OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES

Author

Listed:
  • BYUNG-CHEON CHOI

    (Department of Business Administration, Chungnam National University, 79 Daehangno, Yuseong-gu, Daejeon 305-704, Korea)

  • MYOUNG-JU PARK

    (Department of Industrial and Management Systems Engineering, Kyung Hee University, 1 Seocheondong, Giheung-gu, Yongin-si, Kyunggi-do 446-701, Korea)

Abstract

We consider m-machine permutation flow shop problems with an outsourcing option for a special case where each job's processing time equals the job's processing requirement plus a characteristic value of the machine. The objective is to minimize the sum of the performance measure for in-house jobs (the total completion time or the makespan) and the total outsourcing cost. We prove that two problems are polynomially solvable when the number of machines is fixed.

Suggested Citation

  • Byung-Cheon Choi & Myoung-Ju Park, 2014. "OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-10.
    • Handle: RePEc:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500286
    DOI: 10.1142/S0217595914500286
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595914500286
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595914500286?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    Citations

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


    Cited by:

    1. Myoung-Ju Park & Byung-Cheon Choi & Yunhong Min & Kyung Min Kim, 2020. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-16, January.

    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:wsi:apjorx:v:31:y:2014:i:04:n:s0217595914500286. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.