Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/2216
Nаziv: | Safety times for multistage assembly system | Аutоri: | Lazovic G. Sesum-Cavic V. Mitrović, Dušanka Radojev, Goran Dedović, Nebojša Ishtiaq Chaudhary N. |
Dаtum izdаvаnjа: | 1-јан-2018 | Čаsоpis: | Mathematical Problems in Engineering | Sažetak: | & #x000A9; 2018 Goran Lazovic et al. 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. | URI: | https://open.uns.ac.rs/handle/123456789/2216 | ISSN: | 1024123X | DOI: | 10.1155/2018/8208049 |
Nаlаzi sе u kоlеkciјаmа: | POLJF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
35
Prоtеklа nеdеljа
13
13
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.