Safety Times for Multistage Assembly System

Goran Lazovic, Vesna Sesum-Cavic, Slobodanka Mitrovic, Slobodan Radojevic, Nebojsa Dedovic and Naveed Ishtiaq Chaudhary

Mathematical Problems in Engineering, 2018, vol. 2018, 1-10

Abstract:

Nowadays, a wide class of problems can be solved by using the classical newsboy model. However, in problems where uncertainty of events and randomness are omnipresent, there is a necessity to adapt the existing solutions and/or find new extensions that will properly answer all requirements. This paper considers a multistage assembly system where interrelated assembly operations with independent stochastic operation times should be planned in an optimal way. Delivery of items in a requested time implies that either delay costs or holding costs appear. The goal is to find optimal safety times. We propose an approximate technique based on successive application of the solution of simpler one-stage problem. The generalized mathematical model suggested is built up on the relaxed hypothesis and can be used in multistage assembly networks. The existence and uniqueness of the solution are proven. The preliminary tests are performed and our approximate technique is compared to exact results.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/8208049.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/8208049.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8208049

DOI: 10.1155/2018/8208049

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().