Planning Order Releases for an Assembly System with Random Operation Times
(2005) In OR Spectrum: Quantitative Approaches in Management 27(2-3). p.459-470- Abstract
- A multi-stage assembly network is considered. A number of end items should be delivered at a certain time. Otherwise a delay cost is incurred. End items and components that are delivered before they are needed will cause holding costs. All operation times are independent stochastic variables. The objective is to choose starting times for different operations in order to minimize the total expected costs. We suggest an approximate decomposition technique that is based on repeated application of the solution of a simpler single-stage problem. The performance of our approximate technique is compared to exact results in a numerical study.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/632974
- author
- Axsäter, Sven LU
- organization
- publishing date
- 2005
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Studies, Cost reduction, Operations research, Stochastic models, Production planning
- in
- OR Spectrum: Quantitative Approaches in Management
- volume
- 27
- issue
- 2-3
- pages
- 459 - 470
- publisher
- Springer
- external identifiers
-
- wos:000229688000013
- scopus:17444390501
- ISSN
- 1436-6304
- DOI
- 10.1007/s00291-004-0186-2
- language
- English
- LU publication?
- yes
- id
- f8d6131c-5dde-4d7d-a668-357597b09cfe (old id 632974)
- date added to LUP
- 2016-04-04 07:29:01
- date last changed
- 2023-01-05 07:09:47
@article{f8d6131c-5dde-4d7d-a668-357597b09cfe, abstract = {{A multi-stage assembly network is considered. A number of end items should be delivered at a certain time. Otherwise a delay cost is incurred. End items and components that are delivered before they are needed will cause holding costs. All operation times are independent stochastic variables. The objective is to choose starting times for different operations in order to minimize the total expected costs. We suggest an approximate decomposition technique that is based on repeated application of the solution of a simpler single-stage problem. The performance of our approximate technique is compared to exact results in a numerical study.}}, author = {{Axsäter, Sven}}, issn = {{1436-6304}}, keywords = {{Studies; Cost reduction; Operations research; Stochastic models; Production planning}}, language = {{eng}}, number = {{2-3}}, pages = {{459--470}}, publisher = {{Springer}}, series = {{OR Spectrum: Quantitative Approaches in Management}}, title = {{Planning Order Releases for an Assembly System with Random Operation Times}}, url = {{http://dx.doi.org/10.1007/s00291-004-0186-2}}, doi = {{10.1007/s00291-004-0186-2}}, volume = {{27}}, year = {{2005}}, }