IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i10p3237-3262.html
   My bibliography  Save this article

A stochastic programming approach for the disassembly line balancing with hazardous task failures

Author

Listed:
  • Eda Goksoy Kalaycilar
  • Sakine Batun
  • Meral Azizoğlu

Abstract

We consider a partial disassembly line balancing problem with hazardous tasks whose successful completions are uncertain. When any hazardous task fails, it causes damages of the tasks on the workstation that it is performed on and all remaining tasks to be performed in the succeeding workstations. We attribute probabilities for the successful completion and failure of the hazardous tasks and aim to maximise the total expected net revenue. We formulate the problem as a two-stage stochastic mixed-integer programme where the assignment of the tasks to the workstations is decided in the first-stage, before the resolution of the uncertainty. We give the formulation for one, two and three hazardous tasks, and then extend to the arbitrary number of hazardous tasks. Our numerical results reveal that proposed stochastic programming models return satisfactory performance and can solve instances with up to 73 tasks very quickly. We observe that the number of tasks, number of hazardous tasks and success probabilities are the most significant parameters that affect the performance. We quantify the value of capturing uncertainty using the expected objective values attained by the solution of the stochastic model and that of the expected value model, and obtain very satisfactory results.

Suggested Citation

  • Eda Goksoy Kalaycilar & Sakine Batun & Meral Azizoğlu, 2022. "A stochastic programming approach for the disassembly line balancing with hazardous task failures," International Journal of Production Research, Taylor & Francis Journals, vol. 60(10), pages 3237-3262, May.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:10:p:3237-3262
    DOI: 10.1080/00207543.2021.1916119
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1916119
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1916119?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:10:p:3237-3262. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.