Publication: Stochastic cyclic scheduling problem in synchronous assembly and production lines
Loading...
Files
Program
KU-Authors
Organization Authors
Co-Authors
Date
Language
Type
Embargo Status
NO
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
In this paper we address the stochastic cyclic scheduling problem in synchronous assembly and production lines. Synchronous lines are widely used in the production and assembly of various goods such as automobiles or household appliances. We consider cycle time minimisation (or throughput rate maximisation) as the objective of the scheduling problem with the assumption that the processing times are independent random variables. We first discuss the two-station case and present a lower bounding scheme and an approximate solution procedure for the scheduling problem. For the general case of the problem, two heuristic solution procedures are presented. An extension of the two-station lower bound to the general case of the problem is also discussed. The performance of the proposed heuristics on randomly generated problems is documented, and the impact of scheduling decisions on problems with different levels of variability in processing times are analysed. We also analyse the problem of sequence determination when the available information is limited to the expected values of individual processing times.
Source
Publisher
Taylor _ Francis
Citation
item.page.haspartof
Source
Journal of the Operational Research Society
item.page.ispartofseries
item.page.edition
DOI
10.1057/palgrave.jors.2600625
